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 int               long long
#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define uniq(v)           (v).erase(unique(all(v)),(v).end())
#define sz(x)             (int)((x).size())
#define fr                first
#define sc                second
#define pii               pair<int,int>
#define rep(i,a,b)        for(int i=a;i<b;i++)
#define el                '\n'
#define fast              ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);





void solve()
{
     int n,k;
    for(int i=0;i<100;i++)
    {

    }
     cin>>n>>k;
     vector<int>ans;


     rep(i,ceil(k/(2*1.0)),k){

        ans.pb(i);




     }
     if(n>k){

        rep(i,k+1,n+1)
          ans.pb(i);
     }
     cout<<sz(ans)<<el;

     for(auto i:ans){
        cout<<i<<' ';
     }
     cout<<el;


}

signed main()
{

   int t=1;
   cin>>t;
  while(t--) solve();
  return 0;
}
