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

public class Untitled{
  static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
  public static void main (String[] args) throws java.lang.Exception
  {
   int t = Integer.parseInt(br.readLine());

    for(int i=0;i<t;i++){
        solve();
    }
  }

  public static void solve() throws IOException{
    StringTokenizer st = new StringTokenizer(br.readLine());
    int n = Integer.parseInt(st.nextToken());
    int k = Integer.parseInt(st.nextToken());
    int cnt=0;
    HashSet<Integer> hs = new HashSet<>();


    for(int i=(k+1)/2;i<k;i++){
      // if(hs.contains(k-i) || hs.contains(i)){
      //   continue;
      // }else{
        hs.add(i);
        cnt++;
      // }
    }
    for(int i=k+1;i<=n;i++){
      hs.add(i);
      cnt++;
    }
    System.out.println(cnt);

    if(cnt>0){
      Iterator<Integer> it = hs.iterator();
     while(it.hasNext()){
        System.out.print(it.next() + " ");
     }
     System.out.println();
    }

  }
}