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;
template <class T>
void cmax(T& _, T __) {
  if (_ < __) _ = __;
}
template <class T>
void cmin(T& _, T __) {
  if (_ > __) _ = __;
}
const int INF = 0x3f3f3f3f, maxn = 2e5 + 10;
const long long LINF = (long long)INF << 32 | INF, mod = 1e9 + 7;
int main() {
  ios::sync_with_stdio(false);
  int T, k, n;
  cin >> T;
  while (T--) {
    cin >> n >> k;
    vector<int> a;
    for (int i = 1; i < k; i++) {
      if (accumulate(a.begin(), a.end(), 0) + i >= k) break;
      a.push_back(i);
    }
    cout << (a.size() + n - k) << '\n';
    for (int& x : a) cout << x << ' ';
    for (decltype(k + 1) i = k + 1; i <= (n); ++i) cout << i << ' ';
    cout << "\n";
  }
  return 0;
}
