{"raw_statement":[{"iden":"problem statement","content":"Among the elements of a permutation $P=(P_1,\\ldots,P_N)$ of $(1,\\ldots,N)$, those that satisfy the following condition are called good elements:\n\n*   The element can be included in both a longest increasing subsequence and a longest decreasing subsequence of $P$.\n\nYou are given integers $N$ and $K$. Determine whether there exists a permutation $P$ of $(1,\\ldots,N)$ such that there are exactly $K$ good elements, and if it exists, find one.\nAnswer for $T$ test cases."},{"iden":"constraints","content":"*   All input values are integers\n*   $1 \\leq T \\leq 2\\times 10^5$\n*   $1 \\leq N \\leq 2\\times 10^5$\n*   $0\\leq K \\leq N$\n*   The sum of $N$ over all test cases does not exceed $2\\times 10^5$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$T$\n$\\mathrm{case}_1$\n$\\vdots$\n$\\mathrm{case}_T$\n\nEach test case is given in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"3\n1 0\n7 2\n2 1"},{"iden":"sample output 1","content":"\\-1\n7 4 6 2 3 1 5\n-1\n\nIn the $2$\\-nd test case, $P_4=2$ and $P_5=3$ are good elements.\nIndeed, $(2,3,5)$ is a longest increasing subsequence of $P$. Also, $(7,6,2,1)$ and $(7, 6, 3, 1)$ are longest decreasing subsequences of $P$.\nTherefore, in this sample output, $2$ and $3$ are good elements. The other elements are not good elements, so this output satisfies the condition.\nIn the $1$\\-st and $3$\\-rd test cases, there does not exist a permutation satisfying the condition. Thus, output `-1`."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}