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 double pi = 2.0 * acos(0.0);
char small[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
                  'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
                  's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
long long int big_mod(long long int BASE, long long int POWER,
                      long long int MOD) {
  if (POWER == 0)
    return 1;
  else if (POWER % 2 == 0) {
    long long int RESULT = big_mod(BASE, POWER / 2, MOD);
    return ((RESULT % MOD) * (RESULT % MOD)) % MOD;
  } else
    return ((BASE % MOD) * (big_mod(BASE, POWER - 1, MOD) % MOD)) % MOD;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    int x = k / 2;
    x += n - k;
    cout << x << endl;
    for (int i = k + 1; i <= n; i++) cout << i << " ";
    for (int i = k / 2; i < k; i++) cout << i << " ";
    cout << endl;
  }
}
