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.Scanner;

public class Anti_knapsack {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int a =sc.nextInt();
		for(int i=0;i<a;i++) {
			int b=sc.nextInt();
			int c=sc.nextInt();
			int sum=0;
			int re=0;
			int flg=0;
			if(b ==1 && c==1) {
				System.out.print(0);
			}
			else {
			
			System.out.println(b-(c-(c+1)/2)-1);
			for(int j=(c+1)/2;j<=b;j++) {
				if(j!=c) {
					System.out.print(j+" ");
				}
			}
			
			/*if (flg ==0) {
				System.out.println(b-1);
				for(int j=1;j<=b;j++) {
					if(j!=c) {
					System.out.print(j+" ");
				}
			}}
			else {
				if(c ==1) {
				System.out.println(b-1);}
				else {
					System.out.println(b-2);
				}
				for(int j=2;j<=b;j++) {
					if(j !=c) {
					System.out.print(j+" ");
				}}
			}
		}*/}}
		sc.close();
		

	}

}
