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
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
import math 
from collections import defaultdict,Counter
def ceil(a,b):
    return (a+b-1)//b


for _ in range(ri()):
    n,k=ria()
    x=[1 for i in range(n+1)]
    x[k]=0
    cnt=z=0
    for i in range(1,n+1):
        if x[i]:
            z+=i
            if z==k:
                x[i]=0
            if k>i and k-i!=i:
                x[k-i]=0
    #print(x,z)
    for i in range(1,n+1):
        if x[i]:
            cnt+=1
    wi(cnt)
    for i in range(1,n+1):
        if x[i]:
            print(i,end=' ')
    print()
            
