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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class A_Anti_knapsack {
    
    static int testCases,n,k;
    
    static Scanner scanner=new Scanner();
    
    static void solve(){
        
        /*int a[]=new int[n];
        
        for(int i=1;i<=n;i++){
            
            a[i-1]=i;
            
        }*/
        
        System.out.println( (n-k+k/2) ); 
       
       for(int i=k+1;i<=n;i++){
           
           System.out.print(i+" ");
           
       }
        
       for(int i=(k+1)/2;i<k;i++ ){
           
           System.out.print(i+" ");
           
       }
       
        System.out.println();
       
    }
    
    public static void main(String[] args) throws IOException {
        
        testCases=scanner.nextInt();
        
        for(int i=0;i<testCases;i++){
            
            n=scanner.nextInt();
            k=scanner.nextInt();
            
            solve();
            
        }
        
    }
    
      static class Scanner{
    
    BufferedReader in;

   StringTokenizer st;    

        public Scanner() {
        
            in=new BufferedReader( new InputStreamReader( System.in ) );
            
        }
        
    String next() throws IOException{
        
        while( st==null || !st.hasMoreElements() ){
            
            st=new StringTokenizer(in.readLine());
            
        }
        
        return st.nextToken();
        
    }
   
    int nextInt() throws IOException{
        
        return Integer.parseInt( next() );
        
    }
   
    long nextLong() throws IOException{
        
        return Long.parseLong( next() );
        
    }
    
}
    
}
/*

3
3 2
5 3
1 1

*/

/*

1
8 6

*/