#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--){
        int N,M; cin >> N >> M;
        set<tuple<int,int,int>,greater<>> S;
        vector<int> A(N);
        A.at(M-1) = 1;
        if(M != 1) S.insert({M-1,0,-(M-2)});
        if(M != N) S.insert({N-M,-(M),-(N-1)});

        for(int i=2; i<=N; i++){
            auto[d,l,r] = *S.begin(); S.erase(S.begin());
            l *= -1; r *= -1;
            if(l == 0){
                A.at(l) = i;
                S.insert({(r+1)/2,-1,-r});
            }
            else if(r == N-1){
                A.at(r) = i;
                S.insert({((r-1)-l+2)/2,-l,-(r-1)});
            }
            else{
                int m = l+d-1;
                A.at(m) = i;
                if(l != m) S.insert({((m-1)-l+2)/2,-l,-(m-1)});
                if(m != r) S.insert({(r-(m+1)+2)/2,-(m+1),-r});
            }
        }
        for(int i=0; i<N; i++) cout << A.at(i) << (i==N-1?"\n":" ");
    }

}