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;
#define fr for(i=0;i<n;i++)
typedef long long ll;
ll inf=1e18;
#define pb push_back
#define ft first
#define sc second

int main(){
         ll i,j,k=0,l=0,m,n,nx,a,b,x,c=0,mx=0,h=0,ans,o,e,p,d,y,z,u,r;

         cin>>m;
         while(m--){
         cin>>n>>k;
c=1;
         vector<ll>v;


         for(i=1;i<=n;i++){
        if(i!=k){
        v.pb(i);
        }
         }
       if(n!=1){
         for(i=0;i<=k;i++){
        for(j=i+1;j<=k;j++){
        if(v[i]+v[j]==k){
        v.erase(v.begin()+i);
        c++;i--;
        break;
        }
        }
         }
       }
      cout<<n-c<<endl;
         for(auto i:v){
        cout<<i<<" ";
         }

         cout<<endl;

        }
}
