问题 D: Haitang and Triangle

Given two integers $\textstyle n,m$, construct a permutation of length $\textstyle n$ that satisfies the following conditions.

-   There are exactly $\textstyle m$ subintervals of length $\textstyle 3$ such that the numbers in these subintervals form a (non-degenerate) triangle.

Each test contains multiple test cases. The first line contains an integer $\textstyle T$ ($\textstyle 1\leq T\leq 10^5$) — the number of test cases. The description of the test cases follows.

The first and only line of each test case contains two integers $\textstyle n$ and $\textstyle m$ ($\textstyle 3\leq n\leq 3\times 10^5$, $\textstyle 0\leq m\leq n-2$) — the length of permutation and the target subintervals.

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

For each test case, print one line.

If such a pair of permutations exists, print $\textstyle n$ integers $\textstyle p_i$, representing the permutation you have constructed. Otherwise, print “-1”.