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.lang.reflect.Array;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class trial_2 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int it = 0; it < t; it++) {
            int n = in.nextInt(), k = in.nextInt();
            /*int[] arr = new int[n+1];

            for (int i = 1; i <= n; i++) {
                arr[i] = i;
            }*/

            List<Integer> al = new ArrayList<>();

            for (int i = n; i >= 1; i--) {
                if (i > k) al.add(i);
                else if (i < k) {
                    boolean isOk = true;
                    for (int j = al.size() - 1; j >= 0; j--) {
                        if (i + al.get(j) == k) {
                            isOk = false;
                            break;
                        }
                        else if (i + al.get(j) > k) break;
                    }
                    if (isOk) al.add(i);
                }
            }

            System.out.print(al.size());
            System.out.println("");
            if (al.size() != 0) {
                for (int i = 0; i < al.size(); i++) {
                    System.out.print(al.get(i) + " ");
                }
                System.out.println("");
            }
        }
    }
}
