#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define esper(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
struct S{
  int l,r;
  int pos;
  int far;
  friend bool operator<(S left,S right){
    if(left.far!=right.far)return left.far<right.far;
    return left.pos>right.pos;
  }
  pair<S,S> split(){
    pair<S,S>ret;
    ret.first={l,pos,l+(pos-l-1)/2,(pos-l-1)/2+1};
    ret.second={pos+1,r,pos+1+(r-(pos+1)-1)/2,(r-(pos+1)-1)/2+1};
    if(ret.first.l==ret.first.r)ret.first.far=-1e9;
    if(ret.second.l==ret.second.r)ret.second.far=-1e9;
    debug(l,r,pos,far);
    debug(ret.first.l,ret.first.r,ret.first.pos,ret.first.far);
    debug(ret.second.l,ret.second.r,ret.second.pos,ret.second.far);
    return ret;
  }
};
void SOLVE(){
  int n,m;
  cin>>n>>m;
  m--;
  vector<int>ans(n,-1);
  ans[m]=0;
  priority_queue<S>que;
  if(m!=0)que.push({0,m,0,m});
  if(m!=n-1)que.push({m+1,n,n-1,n-1-m});
  reps(i,1,n){
    auto nx=que.top();que.pop();
    debug(i,nx.l,nx.r);
    assert(nx.l!=nx.r);
    ans[nx.pos]=i;
    auto ps=nx.split();
    que.push(ps.first);
    que.push(ps.second);
  }
  ans++;
  rep(i,n)cout<<ans[i]<<" \n"[i+1==n];
}