#include <iostream>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using LL = long long;
void solve() {
  int n, m;
  scanf("%d%d", &n, &m);
  std::vector<LL> ans;
  m -= 2, ans = {0, (1ll << n) - 1};
  for (int i = 0; i < n && m; ++i) {
    for (int j = i; j >= 0; --j) {
      for (LL s = (1ll << i) - 1; s >= 0; --s) {
        if (__builtin_popcountll(s) == j) {
          LL v = 1ll << i;
          for (int k = 0; k < n; ++k) 
            if (s >> k & 1) v |= (1ll << k);
          if (v != (1ll << n) - 1) ans.push_back(v), --m;
          if (m == 0) goto tpw1;
        }
      }
    }
  }
  tpw1:
  for (auto x : ans) printf("%lld ", x);
  puts("");
}
int main() {
  int t; scanf("%d", &t);
  while (t--) solve();
  return 0;
}