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;
long long a[200009];
map<long long, long long> mp;
int main() {
  cin.sync_with_stdio(false);
  long long i, j, k, l, c, v, n, m, r, t, tt;
  string s;
  cin >> tt;
  while (tt--) {
    cin >> n;
    cin >> m;
    for (i = m + 1, j = 0; i <= n; i++) {
      a[j++] = i;
    }
    c = 0;
    for (i = 1; i < m; i++) {
      if (i != (m + 1) / 2 || m == 2) {
        a[j++] = i;
        c += i;
      }
    }
    cout << j << endl;
    for (i = 0; i < j; i++) cout << a[i] << " ";
    cout << endl;
  }
}
