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.ArrayList;
import java.util.Scanner;
public class Solution {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        int t = input.nextInt();

        for (int i = 0; i < t; i++) {
            int x = input.nextInt();
            int y = input.nextInt();

            if(x - y == 0){
                System.out.println(0);
            }else{
                ArrayList<Integer> out = solve(x,y);
                System.out.println(out.size());
                for (int j = 0; j < out.size(); j++) {
                    if(out.get(j) != 0){
                        System.out.print(out.get(j) + " ");
                    }
                }
                System.out.println();

            }

        }
    }

    public static ArrayList<Integer> solve(int x, int y){
        ArrayList<Integer> out = new ArrayList<>();
        for (int i = x; i >=1 ; i--) {
            if(i != y){
                if(!out.contains(y-i)) {
                    out.add(i);
                }
            }
        }
        return out;
    }


}
