Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>


using namespace std;

#define ll long long

#define rep(i,a,b) for(int i=a;i<b;i+=1)
#define repE(i,a,b) for(int i=a;i<=b;i+=1)

#define pb push_back
const ll MOD = 1e9 + 7;
const ll N = 10, M = 10;
const ll WE = 1e5;


void solve() {
    int n, k;
    cin >> n >> k;



    bool check[n + 1];
    memset(check, 0, sizeof(check));


    for (int i = k + 1; i <= n; i++) {
        check[i] = 1;
    }

    for (int j = k - 1; j >= 1; j--) {
        if (!check[j] && !check[k - j]) {
            check[j] = 1;

        }
    }


    std::vector<int> v;
    for (int i = 1; i <= n; i++) {
        if (check[i]) {
            v.pb(i);
        }
    }

    cout << v.size() << "\n";

    for (auto it : v) {
        cout << it << " ";
    }

    cout << "\n";
}
int main()
{

    ios::sync_with_stdio (0);

    cin.tie (NULL);

    int t = 1;
    cin >> t;

    // compute();

    // sieve();

    while (t--) {
        solve();

    }



    return 0;
}