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
//package cf1493;

import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class A {
    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int T = in.nextInt();

        while(T-->0) {
            int n = in.nextInt();
            int k = in.nextInt();
            ArrayList<Integer> result = new ArrayList<>();

            for(int i = 1; i <= k/2; i++) {
                result.add(i);
            }
            for(int i = k + 1; i <= n; i++) {
                result.add(i);
            }

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

        out.flush();
    }
}
