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<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cmath>
using std::bitset;
using std::vector;
using std::cout;
using std::endl;
using std::swap;
using std::max;
using std::min;

int read(){ 
	int h=0;char c=getchar();
	while(c>'9'||c<'0')c=getchar();
	while(c>='0'&&c<='9')h=(h<<1)+(h<<3)+c-'0',c=getchar();
	return h;
}

//const int MAXN=;
int T;
int n,K;
bool ava[1010];
int m;

int main(){
	T=read();
	while(T--){
		n=read(),K=read();
		memset(ava,false,sizeof(ava));
		for(int i=n;i>K;i--)ava[i]=true;
		for(int i=K-1;i>=1;i--){
			if(i>=K-i)ava[i]=true;
		}
		m=0;
		for(int i=1;i<=n;i++)if(ava[i])m++;
		cout<<m<<endl;
		for(int i=1;i<=n;i++)if(ava[i])cout<<i<<" ";puts("");
	}
	return 0;
	return 0;
}
