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 java.util.*;
import java.io.*;
 
public class cc_march2020_long {
	public static void main(String[] args)  {
		Scanner scn=new Scanner(System.in);
		int t=scn.nextInt();
		while(t-- >0) {
			int n=scn.nextInt();
			int k=scn.nextInt();
			ArrayList<Integer>ans=new ArrayList();
			for(int i=1;i<k;i++) {
				boolean flag=true;
				for(int j=1;j<k;j++) {
					if(i==j)
						continue;
					if(i+j==k) {
						if(j>i)
							ans.add(i);
						flag=false;
						break;
					}
				}
				if(flag) {
					ans.add(i);
				}
			}
			for(int i=k+1;i<=n;i++)
				ans.add(i);
			
			System.out.println(ans.size());
			if(ans.size()>0) {
			for(int val:ans)
				System.out.print(val+" ");
			System.out.println();}
		}
	}
}