#include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

int main() {
    ll T;
    cin >> T;
    while (T--) {
        ll N, M;
        cin >> N >> M;
        vector<ll> ans(N, -1);
        ans[M - 1] = 1;
        // 距離を優先度付きキューによって管理する
        priority_queue<tuple<ll, ll, ll>> pque;
        if (M != 1) {
            pque.push(tuple<ll, ll, ll>(M - 1, M - 2, 2 * (M - 1)));
        }
        if (M != N) {
            pque.push(tuple<ll, ll, ll>(N - M, -M, 2 * (N - M)));
        }
        for (ll i = 2; i <= N; i++) {
            ll half_ps, px, ps;
            tie(half_ps, px, ps) = pque.top();
            pque.pop();
            px *= -1;
            // cout << half_ps << " " << px << " " << ps << endl;
            ans[px + ps / 2 - 1] = i;
            if (px >= 1) {
                if (ps / 2 > 1) {
                    // cout << px << " " << ps / 2 << endl;
                    pque.push(tuple<ll, ll, ll>((ps / 2) / 2, -px, ps / 2));
                }
            }
            if (px + ps <= N) {
                if ((ps + 1) / 2 > 1) {
                    // cout << px + ps / 2 << " " << (ps + 1) / 2 << endl;
                    pque.push(tuple<ll, ll, ll>(((ps + 1) / 2) / 2,
                                                -(px + ps / 2), (ps + 1) / 2));
                }
            }
            // cout << endl;
        }
        for (ll i = 0; i < N; i++) {
            cout << ans[i] << " ";
        }
        cout << endl;
    }
}