#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int MOD=998244353;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
void solve();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int test_case;
  cin>>test_case;
  while (test_case--){
    solve();
  }
}
void solve(){
  int N,M;
  cin>>N>>M;
  M-=1;
  set<int>done;
  priority_queue<array<int,2>>pq;
  pq.push({0,-M});
  vector ans(N,0);
  int cnt=0;
  while(pq.size()){
    int v=-pq.top()[1],d=pq.top()[0];
    pq.pop();
    int l=-N,r=N*2;
    if(done.contains(v))continue;
    auto it0=done.upper_bound(v);
    if(it0!=done.end())r=*it0;
    auto it1=done.lower_bound(v);
    if(it1!=done.begin()){
      it1--;
      l=*it1;
    }
    if(d>min(v-l,r-v))continue;
    ans[v]=++cnt;
    done.insert(v);
    if(l==-N){
      pq.push({v,0});
    }else{
      pq.push({(v-l)/2,-(l+(v-l)/2)});
    }
    if(r==N*2){
      pq.push({N-1-v,-(N-1)});
    }else{
      pq.push({(r-v)/2,-(v+(r-v)/2)});
    }
  }
  rep(i,N){
    if(i)cout<<' ';
    cout<<ans[i];
  }
  cout<<'\n';
}