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>
#define int long long
#define F first
#define S second
#define ii pair<int,int>
using namespace std;
map<int,bool> mp;
vector<int> vec;
void solve()
{
    mp.clear();
    vec.clear();
    int n,k,ans=0;
    scanf("%lld",&n);
    scanf("%lld",&k);
    for(int i=n;i>=1;i--){
        if(i==k)continue;
        if(i>k){
            vec.push_back(i);
            mp[i]=1;
        }
        else if(mp[n-i]==0){
            mp[i]=1;
            vec.push_back(i);
        }
    }
    cout<<vec.size()<<endl;
    for(auto x:vec)printf("%lld ",x);
    cout<<endl;
}
main()
{
    int t=1;
    cin>>t;
    while(t--)solve();
}
