#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

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(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, i0;
    cin >> n >> i0;
    i0--;
    VI ans(n);
    ans[i0] = 0;
    priority_queue<S> q;
    auto add = [&](int l, int r) {
      if (l == r) return;
      int d = l == 0 ? r : r == n ? n - l : (r - l + 1) / 2;
      q.emplace(d, l, r);
    };
    add(0, i0);
    add(i0 + 1, n);
    rep(i, n - 1) {
      auto [d, l, r] = q.top(); q.pop();
      int pos = l == 0 ? 0 : r == n ? n - 1 : (l + r - 1) / 2;
      ans[pos] = i + 1;
      add(l, pos);
      add(pos + 1, r);
    }
    rep(i, n) cout << ans[i] + 1 << " \n"[i + 1 == n];
  }
}