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 subset {
    public static void main(String[] args)
    {
        Scanner scn = new Scanner(System.in);
        int tests = scn.nextInt();

        for(int i = 0 ; i < tests ; i++) {
            int[]chosenNumber = new int[1000];
            int n = scn.nextInt();
            int k = scn.nextInt();
            int m=0;
            for (int j = 1; j<= n; j++)
            {
                boolean possible=true;
                for(int z = j+1 ; z<=n ; z++)
                {
                    if(j+z==k || j==k)
                    {
                        possible=false;
                        z=n;
                    }
                }
                if(possible) {
                    chosenNumber[m]=j;
                    m++;
                }
            }
            if(n==k)
                System.out.println(0);
            else {
                System.out.println(m);
                for (int o = 0; o < m; o++) {
                    System.out.print(chosenNumber[o] + " ");
                }
                System.out.println();
            }
        }


    }
}
