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


# 3 5 7 11 ........
#n=int(input()) 0 1 2



t=int(input())
s=""
for i in range(t):
    L=[]
    L1=[]
    n,k=map(int,input().split())
    
    h=int(k/2)
    if (k%2==1):
        
        for v in range(1,h+1):
            L.append(v)
        L.append(k)
    else:
        
        L.append(0)
        L.append(k)
    for c in range(1,n+1):
        
        if c not in L:
            L1.append(c)
    for x in L1:
        s+=str(x)+" "
    m=L[0]
    for b in L:
        if (m<b):
            m=b
    if (k!=1):
        print(m)    
        print(s)
    else:
        print(0)
        print(s)
    s=""
    L.clear()
    L1.clear()
        
    
       
        


























































































































































































































































































































