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.*;
import java.lang.*;
import java.io.*;

public class A {
    BufferedReader input;
    BufferedWriter output;
    StringTokenizer st;
    
    
    // My Solution
    void solve() throws IOException {
        int t = getInt();
        while (t-->0){
            int n = getInt();
            int k = getInt();
            int nby2 = (int) Math.ceil(k/2.0);
            if(nby2<=n){
                StringBuilder out = new StringBuilder();
                int m = 0;
                for(int i=Math.max(nby2, 1); i<=n; i++){
                    if(i==k)
                        continue;
                    out.append(i).append(" ");
                    m++;
                }
                print(m+"\n");
                print(out.toString());
            }else {
                print("0");
            }
            nextLine();
        }
    }
    
    
    // Some basic functions
    int min(int...i){
        int min = Integer.MAX_VALUE;
        for (int value : i) min = Math.min(min, value);
        return min;
    }
    int max(int...i){
        int max = Integer.MIN_VALUE;
        for (int value : i) max = Math.max(max, value);
        return max;
    }
    // Printing stuff
    void print(int... i) throws IOException {
        for (int value : i) output.write(value + " ");
    }
    void print(long... l) throws IOException {
        for (long value : l) output.write(value + " ");
    }
    void print(String... s) throws IOException {
        for (String value : s) output.write(value);
    }
    void nextLine() throws IOException {
        output.write("\n");
    }
    // Taking Inputs
    int[][] getIntMat(int n, int m) throws IOException {
        int[][] mat = new int[n][m];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                mat[i][j] = getInt();
        return mat;
    }
    char[][] getCharMat(int n, int m) throws IOException {
        char[][] mat = new char[n][m];
        for (int i = 0; i < n; i++) {
            String s = input.readLine();
            for (int j = 0; j < m; j++) 
                mat[i][j] = s.charAt(j);
        }
        return mat;
    }
    int getInt() throws IOException {
        if(st ==null || !st.hasMoreTokens())
            st = new StringTokenizer(input.readLine());
        return Integer.parseInt(st.nextToken());
    }
    int[] getInts(int n) throws IOException {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = getInt();
        return a;
    }
    long getLong() throws IOException {
        if(st==null || !st.hasMoreTokens())
            st = new StringTokenizer(input.readLine());
        return Long.parseLong(st.nextToken());
    }
    long[] getLongs(int n) throws IOException {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = getLong();
        return a;
    }
    // Checks whether the code is running on OnlineJudge or LocalSystem
    boolean isOnlineJudge() {
        if (System.getProperty("ONLINE_JUDGE") != null)
            return true;
        try {
            return System.getProperty("LOCAL")==null;
        } catch (Exception e) {
            return true;
        }
    }
    // Handling CodeExecution
    public static void main(String[] args) throws Exception {
        new A().run();
    }
    void run() throws IOException {
        // Defining Input Streams
        if (isOnlineJudge()) {
            input = new BufferedReader(new InputStreamReader(System.in));
            output = new BufferedWriter(new OutputStreamWriter(System.out));
        } else {
            input = new BufferedReader(new FileReader("input.txt"));
            output = new BufferedWriter(new FileWriter("output.txt"));
        }
        // Running Logic
        solve();
        output.flush();
        // Run example test cases
        if (!isOnlineJudge()) {
            BufferedReader output = new BufferedReader(new FileReader("output.txt"));
            BufferedReader answer = new BufferedReader(new FileReader("answer.txt"));
            StringBuilder outFile = new StringBuilder();
            StringBuilder ansFile = new StringBuilder();
            String temp;
            while ((temp = output.readLine()) != null)
                outFile.append(temp.trim());
            while ((temp = answer.readLine()) != null)
                ansFile.append(temp.trim());
            if (outFile.toString().equals(ansFile.toString()))
                System.out.println("Test Cases Passed!!!");
            else
                System.out.println("Failed...");
        }
    }
}