Problem: Yeah, we failed to make up a New Year legend for this problem.

A permutation of length n is an array of n integers such that every integer from 1 to n appears in it exactly once. 

An element y of permutation p is reachable from element x if x = y, or p_x = y, or p_{p_x} = y, and so on. 

The decomposition of a permutation p is defined as follows: firstly, we have a permutation p, all elements of which are not marked, and an empty list l. Then we do the following: while there is at least one not marked element in p, we find the leftmost such element, list all elements that are reachable from it in the order they appear in p, mark all of these elements, then cyclically shift the list of those elements so that the maximum appears at the first position, and add this list as an element of l. After all elements are marked, l is the result of this decomposition.

For example, if we want to build a decomposition of p = [5, 4, 2, 3, 1, 7, 8, 6], we do the following:

  1. initially p = [5, 4, 2, 3, 1, 7, 8, 6] (bold elements are marked), l = []; 
  2. the leftmost unmarked element is 5; 5 and 1 are reachable from it, so the list we want to shift is [5, 1]; there is no need to shift it, since maximum is already the first element; 
  3. p = [5, 4, 2, 3, 1, 7, 8, 6], l = [[5, 1]]; 
  4. the leftmost unmarked element is 4, the list of reachable elements is [4, 2, 3]; the maximum is already the first element, so there's no need to shift it; 
  5. p = [5, 4, 2, 3, 1, 7, 8, 6], l = [[5, 1], [4, 2, 3]]; 
  6. the leftmost unmarked element is 7, the list of reachable elements is [7, 8, 6]; we have to shift it, so it becomes [8, 6, 7]; 
  7. p = [5, 4, 2, 3, 1, 7, 8, 6], l = [[5, 1], [4, 2, 3], [8, 6, 7]]; 
  8. all elements are marked, so [[5, 1], [4, 2, 3], [8, 6, 7]] is the result. 



The New Year transformation of a permutation is defined as follows: we build the decomposition of this permutation; then we sort all lists in decomposition in ascending order of the first elements (we don't swap the elements in these lists, only the lists themselves); then we concatenate the lists into one list which becomes a new permutation. For example, the New Year transformation of p = [5, 4, 2, 3, 1, 7, 8, 6] is built as follows:

  1. the decomposition is [[5, 1], [4, 2, 3], [8, 6, 7]]; 
  2. after sorting the decomposition, it becomes [[4, 2, 3], [5, 1], [8, 6, 7]]; 
  3. [4, 2, 3, 5, 1, 8, 6, 7] is the result of the transformation. 



We call a permutation good if the result of its transformation is the same as the permutation itself. For example, [4, 3, 1, 2, 8, 5, 6, 7] is a good permutation; and [5, 4, 2, 3, 1, 7, 8, 6] is bad, since the result of transformation is [4, 2, 3, 5, 1, 8, 6, 7].

Your task is the following: given n and k, find the k-th (lexicographically) good permutation of length n.

Input

The first line contains one integer t (1 ≤ t ≤ 1000) — the number of test cases.

Then the test cases follow. Each test case is represented by one line containing two integers n and k (1 ≤ n ≤ 50, 1 ≤ k ≤ 10^{18}).

Output

For each test case, print the answer to it as follows: if the number of good permutations of length n is less than k, print one integer -1; otherwise, print the k-th good permutation on n elements (in lexicographical order).

Example

Input


5
3 3
5 15
4 13
6 8
4 2


Output


2 1 3 
3 1 2 5 4 
-1
1 2 6 3 4 5 
1 2 4 3 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long int INF = (long long int)1 << 60;
const long long int MAX = 1e9 + 7;
void array_show(int *array, int array_n, char middle = ' ') {
  for (int i = 0; i < array_n; i++)
    printf("%d%c", array[i], (i != array_n - 1 ? middle : '\n'));
}
void array_show(long long int *array, int array_n, char middle = ' ') {
  for (int i = 0; i < array_n; i++)
    printf("%lld%c", array[i], (i != array_n - 1 ? middle : '\n'));
}
void array_show(vector<int> &vec_s, int vec_n = -1, char middle = ' ') {
  if (vec_n == -1) vec_n = vec_s.size();
  for (int i = 0; i < vec_n; i++)
    printf("%d%c", vec_s[i], (i != vec_n - 1 ? middle : '\n'));
}
void array_show(vector<long long int> &vec_s, int vec_n = -1,
                char middle = ' ') {
  if (vec_n == -1) vec_n = vec_s.size();
  for (int i = 0; i < vec_n; i++)
    printf("%lld%c", vec_s[i], (i != vec_n - 1 ? middle : '\n'));
}
class union_find_tree {
 private:
  static constexpr int uft_N = 100005;
  int uft_n;
  queue<int> uft_q1;
  vector<int> uft_parent;
  vector<int> uft_num;

 public:
  void init() {
    uft_parent.assign(uft_n, -1);
    uft_num.assign(uft_n, 0);
  }
  union_find_tree(int uft_num) {
    assert(uft_num >= 0);
    uft_n = uft_num;
    init();
  }
  union_find_tree() {
    uft_n = uft_N;
    init();
  }
  int check_parent(int uft_x) {
    assert(uft_x >= 0 && uft_x < uft_n);
    if (uft_parent[uft_x] != -1) {
      uft_q1.push(uft_x);
      return check_parent(uft_parent[uft_x]);
    }
    int uft_a;
    while (!uft_q1.empty()) {
      uft_a = uft_q1.front(), uft_q1.pop();
      uft_parent[uft_a] = uft_x;
    }
    return uft_x;
  }
  bool connect(int uft_x, int uft_y) {
    assert(uft_x >= 0 && uft_x < uft_n);
    assert(uft_y >= 0 && uft_y < uft_n);
    uft_x = check_parent(uft_x), uft_y = check_parent(uft_y);
    if (uft_x == uft_y) return true;
    uft_parent[uft_x] = uft_y;
    uft_num[uft_y] += uft_num[uft_x];
    return false;
  }
};
void init() {}
long long int kai[100];
long long int cnt[100];
void solve() {
  long long int n, m;
  long long int i, j, k;
  long long int a, b, c, d;
  cin >> n >> m;
  if (cnt[n] < m) {
    cout << -1 << endl;
    return;
  }
  vector<int> v1;
  vector<int> vs(n, -1);
  union_find_tree ua(n);
  bool used[100];
  memset(used, false, sizeof(used));
  m--;
  long long int p, q, r;
  p = n;
  for (i = 1; i <= p; i++) {
    if (i > 2)
      a = kai[i - 2];
    else
      a = 1;
    if (a >= INF || a >= INF / cnt[p - i] + 1) {
      a = INF;
    } else
      a *= cnt[p - i];
    if (a <= m) {
      m -= a;
      continue;
    }
    a = n - p;
    if (i == 1) {
      vs[a] = a;
      p -= i;
      i = 0;
      continue;
    }
    if (i == 2) {
      vs[a] = a + 1, vs[a + 1] = a;
      p -= i;
      i = 0;
      continue;
    }
    b = m / cnt[p - i], m %= cnt[p - i];
    used[a + i - 1] = true;
    ua.connect(a + i - 1, a);
    vs[a] = a + i - 1;
    for (k = a + 1; k < a + i - 1; k++) {
      j = a + i - 2 - k;
      c = b / kai[j], b %= kai[j];
      int par = ua.check_parent(k);
      for (j = a; j < a + i; j++) {
        if (k == j || used[j] || par == j) continue;
        if (c == 0) break;
        c--;
      }
      vs[k] = j;
      used[j] = true;
      ua.connect(j, k);
    }
    vs[a + i - 1] = ua.check_parent(a + i - 1);
    p -= i;
    i = 0;
  }
  for (auto &node : vs) node++;
  array_show(vs);
}
int main() {
  long long int n, i, j;
  long long int a, b;
  const int N = 50;
  init();
  cin >> n;
  kai[0] = 1;
  for (i = 1; i <= N; i++) {
    if (kai[i - 1] >= INF / i + 1)
      kai[i] = INF;
    else
      kai[i] = kai[i - 1] * i;
    if (kai[i] >= INF) kai[i] = INF;
  }
  cnt[1] = 1, cnt[0] = 1;
  for (i = 2; i <= N; i++) {
    for (j = 1; j <= i; j++) {
      if (j > 2)
        a = kai[j - 2];
      else
        a = 1;
      if (a >= INF || a >= INF / cnt[i - j] + 1) {
        cnt[i] = INF;
        break;
      }
      cnt[i] += cnt[i - j] * a;
      if (cnt[i] >= INF) {
        cnt[i] = INF;
        break;
      }
    }
  }
  for (i = 0; i < n; i++) {
    solve();
  }
}