You are given two integers n and k. You are asked to choose maximum number of distinct integers from 1 to n so that there is no subset of chosen numbers with sum equal to k.

A subset of a set is a set that can be obtained from initial one by removing some (possibly all or none) elements of it.

Input

The first line contains the number of test cases T (1 ≤ T ≤ 100).

Each of the next T lines contains two integers n and k (1 ≤ k ≤ n ≤ 1000) — the description of test cases.

Output

For each test case output two lines. In the first line output a single integer m — the number of chosen integers.

In the second line output m distinct integers from 1 to n — the chosen numbers.

If there are multiple answers, print any. You can print the numbers in any order.

Example

Input


3
3 2
5 3
1 1


Output


2
3 1 
3
4 5 2 
0
import sys, math
import copy
import heapq

from collections import deque
input = sys.stdin.readline

#input
def ip(): return int(input())
def sp(): return str(input().rstrip())

def mip(): return map(int, input().split())
def msp(): return map(str, input().split())

def lmip(): return list(map(int, input().split()))
def lmsp(): return list(map(str, input().split()))

#gcd, lcm
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

def lcm(x, y):
    return x * y // gcd(x, y)

#prime
def isprime(x):
    if x==1: return False
    for i in range(2, int(x**0.5)+1):
        if x%i==0:
            return False
    return True

# Union Find
# p = {i:i for i in range(1, n+1)}
def find(x):
    if x == p[x]:
        return x
    q = find(p[x])
    p[x] = q
    return q

def union(x, y):
    global n
    x = find(x)
    y = find(y)

    if x != y:
        p[y] = x

############### Main! ###############

tc = ip()
while tc:
    tc -=1
    n, k = mip()
    ans = []
    for i in range(1, n+1):
        if i <= (k-1)//2: continue
        if i == k: continue
        ans.append(i)
    print(len(ans))
    print(*ans)


######## Priest W_NotFoundGD ########