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
for _ in range(int(input())):
    n,k=map(int,input().split())
    s=0
    l=[]
    for i in range(0,n):
        l.append(i+1)
    a=[]
    if(n>=2):
        if(l[0]==k):
            a.append(l[1])
        else:
            a.append(l[0])
    if(n==1):
        if(l[0]!=k):
            a.append(l[0])
        else:
            print("0")
    for i in range(n):
        for j in range(len(a)):
            if(l[i]!=k and l[i]+a[j]!=k):
                a.append(l[i])
    res = [] 
    for i in a: 
        if i not in res: 
            res.append(i) 
    print(len(res))
    print(*res)
    