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:
//package MyPackage;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class A705 {
  public static void main(String[] args) {
    MyScanner sc = new MyScanner();
    out = new PrintWriter(new BufferedOutputStream(System.out));

    int t = sc.nextInt();
    int n;
    int k;
    int count;

    while (t-- > 0) {
      n = sc.nextInt();
      k = sc.nextInt();
      count = 0;

      int[] arr = new int[n + 1];

      for (int i = 1; i <= n; i += 1) {
        if (i == k) {
          arr[i] = 0;
          continue;
        }

        if (arr[i] == 1) {
          continue;
        }

        if (k - i > 0) {
          arr[i] = 0;
          arr[k - i] = 1;
        } else {
          arr[i] = 1;
        }
      }

      for (int i = 1; i <= n; i += 1) {
        if (arr[i] == 1) {
          count += 1;
        }
      }

      out.println(count);

      if (count > 0) {
        for (int i = 1; i <= n; i += 1) {
          if (arr[i] == 1) {
            out.print(i);
            out.print(" ");
          }
        }
        out.println();
      }
    }
    // Stop writing your solution here. -------------------------------------
    out.close();
  }

  // -----------PrintWriter for faster output---------------------------------
  public static PrintWriter out;

  // -----------MyScanner class for faster input----------
  public static class MyScanner {
    BufferedReader br;
    StringTokenizer st;

    public MyScanner() {
      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;
    }
  }
  // --------------------------------------------------------
}