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
#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    int a[n];
    int found = 0;
    for (int i = 0; i < n; i++) {
      a[i] = i + 1;
      if (i == k - 1) {
        found = 1;
      }
    }
    if (found) {
      n = n - 1;
      for (int j = k - 1; j < n; j++) {
        a[j] = a[j + 1];
      }
    }
    if (k != 2 and k != 1 and k != 3 and n != 1) {
      if (k % 2 == 0) {
        for (int i = 0; i < k / 2 - 2; i++) {
          n = n - 1;
          for (int j = 0; j < n; j++) {
            a[j] = a[j + 1];
          }
        }
      } else {
        for (int i = 0; i < k / 2 - 1; i++) {
          n = n - 1;
          for (int j = 0; j < n; j++) {
            a[j] = a[j + 1];
          }
        }
      }
    }
    if (n == 1) {
      n = n - 1;
      for (int j = 0; j < n; j++) {
        a[j] = a[j + 1];
      }
    }
    if (k == 3) {
      for (int i = 0; i < k / 2; i++) {
        n = n - 1;
        for (int j = 0; j < n; j++) {
          a[j] = a[j + 1];
        }
      }
    }
    cout << n << '\n';
    for (int i = 0; i < n; i++) {
      cout << a[i] << " ";
    }
    cout << '\n';
  }
  return 0;
}
