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 solve(void) {
  int t, n, k;
  cin >> t;
  while (t--) {
    cin >> n >> k;
    vector<int> list;
    for (int i = 1; i <= n; i++) {
      if (i == k)
        continue;
      else
        list.push_back(i);
    }
    if (list.size() > 1) {
      for (int i = 0; i < list.size(); i++) {
        int temp = list[i];
        for (int q = i + 1; q < list.size(); q++) {
          if (abs(list[temp] + list[q]) == k) {
            list.erase(list.begin() + i);
            i = 0;
            break;
          }
        }
      }
      cout << list.size() << endl;
      for (int e : list) cout << e << " ";
    } else if (list.size() == 1) {
      cout << list.size() << endl;
      for (int e : list) cout << e << " ";
    } else
      cout << "0";
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(0), cin.tie(0);
  solve();
  return 0;
}
