#include <bits/stdc++.h>
using namespace std;
long long fact[55];
long long dp[55];
long long safe_mul(long long a, long long b) {
  if (a == -1LL || b == -1LL) return -1LL;
  double d = 1.0L * a * b;
  if (d >= 2e18) return -1LL;
  long long dd = a * b;
  if (dd > 1000000000000000000LL) return -1LL;
  return dd;
}
void safe_add(long long &a, long long b) {
  if (a == -1LL || b == -1LL)
    a = -1LL;
  else {
    a += b;
    if (a > 1000000000000000000LL) a = -1LL;
  }
}
vector<int> getidx(int n, long long k) {
  vector<int> res;
  for (int i = 0; i < n; i++) {
    long long unit = fact[n - i - 1];
    if (unit == -1LL) {
      res.push_back(0);
      continue;
    }
    long long q = (k - 1) / unit;
    long long r = (k - 1) % unit;
    k = r + 1;
    res.push_back(q);
  }
  return res;
}
vector<int> solve(int n, long long k) {
  if (n == 0) return vector<int>();
  if (dp[n] != -1LL && dp[n] < k) {
    return vector<int>();
  }
  int first = -1;
  for (int i = 1; i <= n; i++) {
    long long tmp = safe_mul(i == 1 ? 1LL : fact[i - 2], dp[n - i]);
    if (tmp == -1LL || tmp >= k) {
      first = i;
      break;
    } else
      k -= tmp;
  }
  long long unit = dp[n - first];
  vector<int> ans;
  ans.push_back(first);
  if (unit == -1LL) {
    vector<int> bk = solve(n - first, k);
    for (int i = 1; i < first; i++) {
      ans.push_back(i);
    }
    for (auto &c : bk) {
      ans.push_back(c + first);
    }
    return ans;
  }
  long long q = (k - 1) / unit;
  long long r = (k - 1) % unit;
  vector<int> bk = solve(n - first, r + 1);
  if (first == 1) {
    for (auto &c : bk) {
      ans.push_back(c + 1);
    }
    return ans;
  } else if (first == 2) {
    ans.push_back(1);
    for (auto &c : bk) {
      ans.push_back(c + 2);
    }
    return ans;
  }
  vector<int> vi = getidx(first - 2, q + 1);
  set<int> cand;
  for (int i = 1; i < first; i++) {
    cand.insert(i);
  }
  vector<int> nxt(first + 3);
  nxt[1] = first;
  for (int i = 2; i < first; i++) {
    vector<int> nc;
    for (auto &c : cand) {
      nxt[i] = c;
      int cur = i;
      do {
        cur = nxt[cur];
      } while (cur != 0 && cur != i);
      nxt[i] = 0;
      if (cur == 0) nc.push_back(c);
    }
    nxt[i] = nc[vi[i - 2]];
    ans.push_back(nc[vi[i - 2]]);
    cand.erase(nc[vi[i - 2]]);
  }
  ans.push_back(*cand.begin());
  for (auto &c : bk) {
    ans.push_back(c + first);
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  fact[0] = 1;
  for (int i = 1; i <= 50; i++) {
    fact[i] = safe_mul(fact[i - 1], i);
  }
  dp[1] = dp[0] = 1LL;
  for (int i = 2; i <= 50; i++) {
    for (int j = 1; j <= i; j++) {
      long long lhs = j == 1 ? 1LL : fact[j - 2];
      long long rhs = dp[i - j];
      safe_add(dp[i], safe_mul(lhs, rhs));
    }
  }
  while (t--) {
    int n;
    long long k;
    cin >> n >> k;
    vector<int> ans = solve(n, k);
    if (ans.empty()) {
      cout << "-1\n";
      continue;
    }
    for (int i = 0; i < n; i++) {
      if (i) cout << ' ';
      cout << ans[i];
    }
    cout << '\n';
  }
  return 0;
}
