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;
void swap(long long int *xp, long long int *yp) {
  long long int temp = *xp;
  *xp = *yp;
  *yp = temp;
}
int indx(vector<int> a) {
  int max = INT_MIN, idx = 0;
  for (int i = 0; i < a.size(); i++) {
    if (max < a[i]) {
      max = a[i];
      idx = i;
    }
  }
  return idx;
}
int main() {
  int q;
  cin >> q;
  while (q--) {
    int n, k;
    cin >> n >> k;
    vector<int> a(0);
    int c = 0;
    for (int i = 1; i <= k / 2; i++) {
      a.push_back(i);
      c++;
    }
    for (int i = k + 1; i <= n; i++) {
      a.push_back(i);
      c++;
    }
    cout << c << endl;
    if (c != 0) {
      for (int i = 0; i < a.size(); i++) cout << a[i] << " ";
    }
    cout << endl;
  }
  return 0;
}
