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;
const long long mod = 1e9 + 7;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
bool primecheck(long long n) {
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      return 0;
    }
  }
  return 1;
}
long long power(long long x, long long y, long long mod) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % (mod);
    y = y >> 1;
    x = (x * x) % mod;
  }
  return res % mod;
}
int main() {
  fast();
  long long t;
  cin >> t;
  while (t--) {
    long long n, k;
    cin >> n >> k;
    long long sum = 0;
    vector<long long> v;
    long long i = 1;
    while (sum + i < k) {
      v.push_back(i);
      sum += i;
      i++;
    }
    for (long long i = k + 1; i <= n; i++) {
      v.push_back(i);
    }
    cout << v.size() << "\n";
    for (auto x : v) {
      cout << x << ' ';
    }
    cout << "\n";
  }
}
