#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
int N,M;
int D[303030];
int ret[303030];
set<int> Ss[303030];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>N>>M;
		set<int> S;
		M--;
		ret[M]=0;
		S.insert(M);
		S.insert(-1<<20);
		S.insert(1<<20);
		FOR(i,N) {
			D[i]=abs(i-M);
			Ss[D[i]].insert(i);
		}
		int nex=1;
		for(i=N;i>=1;i--) while(Ss[i].size()) {
			x=*Ss[i].begin();
			Ss[i].erase(x);
			ret[x]=nex++;
			int ne=*S.lower_bound(x);
			int pr=*prev(S.lower_bound(x));
			S.insert(x);
			for(j=max(0,pr+1);j<min(N,ne);j++) if(j!=x) {
				Ss[D[j]].erase(j);
				if(j<x) D[j]=min(abs(j-pr),abs(j-x));
				if(j>x) D[j]=min(abs(j-ne),abs(j-x));
				if(D[j]) Ss[D[j]].insert(j);
			}
		}
		
		FOR(i,N) cout<<ret[i]+1<<" ";
		cout<<endl;
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}