CF1508B.Almost Sorted

Seiji Maki doesn't only like to observe relationships being unfolded, he also likes to observe sequences of numbers, especially permutations. Today, he has his eyes on almost sorted permutations.

A permutation $a_1, a_2, \dots, a_n$ of $1, 2, \dots, n$ is said to be almost sorted if the condition $a_{i + 1} \ge a_i - 1$ holds for all $i$ between $1$ and $n - 1$ inclusive.

Maki is considering the list of all almost sorted permutations of $1, 2, \dots, n$, given in lexicographical order, and he wants to find the $k$-th permutation in this list. Can you help him to find such permutation?

Permutation $p$ is lexicographically smaller than a permutation $q$ if and only if the following holds:

• in the first position where $p$ and $q$ differ, the permutation $p$ has a smaller element than the corresponding element in $q$.

青木诚司不仅喜欢观察人际关系的展开，还喜欢观察数字序列，尤其是排列。今天，他的目光聚焦于“几乎有序”的排列。

对于 $1, 2, \dots, n$ 的一个排列 $a_1, a_2, \dots, a_n$，若对所有满足 $1 \le i \le n - 1$ 的 $i$ 均有 $a_{i + 1} \ge a_i - 1$，则称该排列为几乎有序排列。

青木诚司正在考虑所有 $1, 2, \dots, n$ 的几乎有序排列，并按字典序升序列出。他希望找出该列表中第 $k$ 个排列。你能帮他找到这个排列吗？

当且仅当满足以下条件时，排列 $p$ 在字典序上小于排列 $q$：

• 在 $p$ 与 $q$ 首次出现差异的位置上，$p$ 中对应位置的元素小于 $q$ 中对应位置的元素。

The first line contains a single integer $t$ ($1\le t\le 1000$) — the number of test cases.

Each test case consists of a single line containing two integers $n$ and $k$ ($1 \le n \le 10^5$, $1 \le k \le 10^{18}$).

It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$.

第一行包含一个整数 $t$（$1\le t\le 1000$）—— 表示测试用例的数量。

每个测试用例由一行组成，包含两个整数 $n$ 和 $k$（$1 \le n \le 10^5$，$1 \le k \le 10^{18}$）。

保证所有测试用例的 $n$ 之和不超过 $10^5$。

For each test case, print a single line containing the $k$-th almost sorted permutation of length $n$ in lexicographical order, or $-1$ if it doesn't exist.

对于每个测试用例，输出一行，包含长度为 $n$ 的第 $k$ 个几乎有序排列（按字典序），如果不存在则输出 $-1$。

For the first and second test, the list of almost sorted permutations with $n = 1$ is ${[1]}$.

For the third and fifth test, the list of almost sorted permutations with $n = 3$ is ${[1, 2, 3], [1, 3, 2], [2, 1, 3], [3, 2, 1]}$.

对于第一和第二个测试，$n = 1$ 的几乎有序排列列表为 ${[1]}$。

对于第三和第五个测试，$n = 3$ 的几乎有序排列列表为 ${[1, 2, 3], [1, 3, 2], [2, 1, 3], [3, 2, 1]}$。