// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
#define i128 __int128
//#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

struct ufs{
	int fa[maxn],sz[maxn];
	stack<pii>s;
	void init(int n){
		For(i,1,n)fa[i]=i,sz[i]=0;
		while(s.size())s.pop();
	}
	inline int getf(int x){while(x!=fa[x])x=fa[x];return x;}
	inline bool merge(int x,int y){
		x=getf(x),y=getf(y);
		if(x==y)return 0;
		if(sz[x]>sz[y])swap(x,y);
		s.push(mkp(x,sz[x]==sz[y]));
		fa[x]=y,sz[y]+=s.top().se;
		return 1;
	}
	inline bool chk(int x,int y){
		return getf(x)==getf(y);
	}
	void back(int t){
		while(s.size()>t){
			sz[fa[s.top().fi]]-=s.top().se;
			fa[s.top().fi]=s.top().fi;
			s.pop();
		}
	}
}U;

int n,k;

int l,r,p[maxn],ok;
void dfs(int u){
	if(l>r){
		ok=1;
		return;
	}
	int v=n-u+1;
	if(u==v){
		p[l]=u;
		ok=1;
		return;
	}
	// [v,u],....   or  ....,[u,v]
	p[l]=v,p[l+1]=u;
	int tim=U.s.size();
	if(U.merge(p[l],l)){
		if(r==l+1 || U.merge(p[l+1],l+1)){
//			cout<<"Addl "<<v<<" "<<u<<"\n";
			l+=2;
			dfs(u+1);
			if(ok)return;
			l-=2;
		}
	}
	U.back(tim);
	p[r]=v,p[r-1]=u;
	if(U.merge(p[r],r)){
		if(r==l+1 || U.merge(p[r-1],r-1)){
//			cout<<"Addr "<<u<<" "<<v<<" "<<r<<"\n";
//			For(i,1,n)cout<<p[i]<<" \n"[i==n];
			r-=2;
			dfs(u+1);
			if(ok)return;
			r+=2;
		}
	}
	U.back(tim);
}

bool vis[maxn];
int calc(){
	For(i,1,n)vis[i]=0;
	For(i,1,n){
		assert(p[i]>=1 && p[i]<=n);
		assert(!vis[p[i]]);
		vis[p[i]]=1;
	}
	int res=0;
	For(i,1,n)vis[i]=0;
	For(i,1,n)if(!vis[i]){
		for(int u=i;!vis[u];u=p[u])vis[u]=1;
		++res;
	}
	return res;
}
int q[maxn];

void work()
{
	n=read(),k=read();
	if(n==7){
		if(k==8){
			puts("2\n4 3 5 2 6 1 7");
		}else{
			puts("1\n2 7 1 6 3 5 4");
		}return;
		auto chk=[&](){
			For(i,1,n-1)if(p[i]+p[i+1]>k)return 0;
			return 1;
		};
		For(i,1,n)p[i]=i; int mn=n+1;
		do{
			if(!chk())continue;
			int tmp=calc();
			if(tmp<mn){
				mn=tmp;
				For(i,1,n)q[i]=p[i];
			}
		}while(next_permutation(p+1,p+n+1));
		cout<<mn<<"\n";
		For(i,1,n)cout<<q[i]<<" \n"[i==n];
		return;
	}
	U.init(n);
	ok=0; l=1,r=n;
	dfs(1);
	assert(ok);

	cout<<1<<"\n";
	For(i,1,n)cout<<p[i]<<" ";cout<<"\n";
	assert(calc()==1);
}

signed main()
{
//	freopen("data.in","r",stdin);
//	freopen("my.out","w",stdout);
	int T=read();
	while(T--)work();
	return 0;
}
/*
brute
*/