Problem: 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

Solution (in JAVA):

Solution:


/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

/**
 *
 * @author is2ac
 */
public class A_CF {

    public static void main(String[] args) {
        FastScanner55 fs = new FastScanner55();
        PrintWriter pw = new PrintWriter(System.out);
        int t = fs.ni();
        for (int tc = 0; tc < t; tc++) {
            int n = fs.ni();
            int k = fs.ni();
            int ct = 0;
            for (int i = 1; i <= n; i++) {
                if (i>k) ct++;
                if (i<k && i>= k/2 + k%2) ct++;
            }
            pw.println();
            pw.println(ct);
            for (int i = 1; i <= n; i++) {
                if (i>k) pw.print(i + " ");
                if (i<k && i>= k/2 + k%2) pw.print(i + " ");
            }
        }
        pw.close();
    }

    public static boolean g(boolean a, boolean b, boolean c, String s) {
        boolean[] arr = {a, b, c};
        int open = 0;
        for (int i = 0; i < s.length(); i++) {
            if (arr[s.charAt(i) - 'A']) {
                open++;
            } else {
                open--;
                if (open < 0) {
                    return false;
                }
            }
        }
        return open == 0;
    }
}

class FastScanner55 {

    BufferedReader br;
    StringTokenizer st;

    public FastScanner55() {
        br = new BufferedReader(new InputStreamReader(System.in), 32768);
        st = null;
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int ni() {
        return Integer.parseInt(next());
    }

    int[] intArray(int N) {
        int[] ret = new int[N];
        for (int i = 0; i < N; i++) {
            ret[i] = ni();
        }
        return ret;
    }

    long nl() {
        return Long.parseLong(next());
    }

    long[] longArray(int N) {
        long[] ret = new long[N];
        for (int i = 0; i < N; i++) {
            ret[i] = nl();
        }
        return ret;
    }

    double nd() {
        return Double.parseDouble(next());
    }

    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
}