#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct S {
	int d, l, r;
	bool operator<(const S& rhs) const {
		return d < rhs.d || (d == rhs.d && l > rhs.l);
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, m; cin >> n >> m;
		m--;
		priority_queue<S> q;
		vector<int>ans(n, -1);
		ans[m] = 0;
		auto add = [&](int l, int r) {
			if (l == r) return;
			int d = l == 0 ? r : r == n ? n - l : (r - l + 1) / 2;
			q.push({ d, l, r });
		};
		add(0, m);
		add(m + 1, n);
		rep(i, n - 1) {
			auto[d, l, r] = q.top();
			q.pop();
			int pos = 0 == l ? 0 : n == r ? n - 1 : (l + r - 1) / 2;
			ans[pos] = i + 1;
			add(l, pos);
			add(pos + 1, r);
		}
		rep(i, n)cout << ans[i] + 1 << " ";
		cout << endl;
	}
	return 0;
}