#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int solve(){
	int n, m;
	cin >> n >> m;
	m--;
	vector<int> ans(n);
	using T = tuple<int, int, int>;
	priority_queue<T> pq;
	auto divide = [&](int l, int r, int pos){
		pq.emplace((pos - l + 1) / 2, -l, -pos);
		pq.emplace((r - (pos + 1) + 1) / 2, -(pos + 1), -r);
	};
	ans[m] = 1;
	pq.emplace(m, -0, -m);
	pq.emplace((n - 1) - m, -(m + 1), -n);
	for(int num = 2; num <= n; num++){
		auto [tmp, _l, _r] = pq.top(); pq.pop();
		int l = -_l;
		int r = -_r;
		if(l == 0){
			ans[l] = num;
			divide(l, r, l);
		}else if(r == n){
			ans[r - 1] = num;
			divide(l, r, r - 1);
		}else{
			int pos = l + (r - l - 1) / 2;
			ans[pos] = num;
			divide(l, r, pos);
		}
//		cout << tmp << ' '<< l << ' ' << r << "\n";
	}
	cout << ans;
	return 0;
}

int main(){
	int t;
	cin >> t;
	rep(i, t) solve();
	return 0;
}