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 <stdio.h>
#include <string.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <bitset>
#include <time.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5 +10;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double eps = 1e-8;
const int maxn = 8e7+10;
const int INF = 1e9+7;
const double mpi=3.1415926535;
inline int read() {
    int f=1,x=0;char ch;
    do {ch=getchar(); if(ch=='-') f=-1;} while (ch<'0'||ch>'9');
    do {x=x*10+ch-'0'; ch=getchar(); } while (ch>='0'&&ch<='9');
    return x*f;
}
 
void redirect() {
    #ifdef LOCAL
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
}

int n,m;


int main() {
    redirect();
    int T=1;
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&n,&m);
        map<int,int>mp;
        mp.clear();
        for(int i=m+1;i<=n;i++)mp[i]++;
        for(int i=m-1;i>=1;i--)
            if(mp.find(m-i)!=mp.end())break;
            else mp[i]++;
        printf("%d\n",mp.size());
        for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++)
            printf("%d ",it->first);
        puts("");
    }

    return 0;
}