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>
#include <ext/pb_ds/assoc_container.hpp>

#define ll          	long long
#define ld          	long double
#define fi          	first
#define se          	second
#define pb          	push_back
#define mp              make_pair
#define X               real()
#define Y               imag()
#define all(c)          (c).begin(), (c).end()
#define strToInt(a)   	atoi(a.c_str())

using namespace std;
using namespace __gnu_pbds;

typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

void solve() {
    ll n, k;
    cin >> n >> k;
    cout << n - k + k / 2 << endl;
    for (int i = 1; i <= k / 2; ++i) {
        cout << i << " ";
    }
    for (int i = k + 1; i <= n; ++i) {
        cout << i << " ";
    }
    cout << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    ll t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}
