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.io.*;
 
public class Main2 {
	static class FastReader{ 
        BufferedReader br; 
        StringTokenizer st; 
        public FastReader(){br = new BufferedReader(new InputStreamReader(System.in));}
        String next(){ while (st == null || !st.hasMoreElements()){ 
                try{st = new StringTokenizer(br.readLine());} 
                catch (IOException  e){e.printStackTrace();}} 
            return st.nextToken();}
        int nextInt(){ return Integer.parseInt(next());}
        long nextLong(){return Long.parseLong(next());} 
        double nextDouble(){return Double.parseDouble(next());}
        String nextLine(){ 
            String str = ""; 
            try{str = br.readLine(); } 
            catch (IOException e) {e.printStackTrace();} 
            return str; } 
    }
	static FastReader sc = new FastReader();
	public static void main (String[] args) {
		PrintWriter out = new PrintWriter(System.out);
		int t = 1;
    	t = sc.nextInt();
    	while(t-->0) {
    		int n = sc.nextInt();
    		int k = sc.nextInt();
    		List<Integer> s = new ArrayList<>();
     		for(int i=1;i<=n;i++) {
     			if(i>k) s.add(i);
     			else {
     				if(!check(s,k-i)) s.add(i);
     			}
     		}
     		out.write(s.size()+"\n");
     		for(int val : s)
     			out.write(val+" ");
     		out.write("\n");
      	}
		out.close();
	}
	static boolean check(List<Integer> s,int val) {
		int i=0,j=0;
		int x = 0;
		while(i<s.size() || j<s.size()) {
			while(x>val && i<s.size()) {
				x -= s.get(i++);
			}
			while(x<val && j<s.size()) {
				x += s.get(j++);
			}
			if(x == val || (x>val && i == s.size()) || (x<val && j == s.size())) break;
		}
		return x == val;
	}
}