CF1914B.Preparing for the Contest

Monocarp is practicing for a big contest. He plans to solve $n$ problems to make sure he's prepared. Each of these problems has a difficulty level: the first problem has a difficulty level of $1$, the second problem has a difficulty level of $2$, and so on, until the last ($n$-th) problem, which has a difficulty level of $n$.

Monocarp will choose some order in which he is going to solve all $n$ problems. Whenever he solves a problem which is more difficult than the last problem he solved, he gets excited because he feels like he's progressing. He doesn't get excited when he solves the first problem in his chosen order.

For example, if Monocarp solves the problems in the order $[3, \underline{5}, 4, 1, \underline{6}, 2]$, he gets excited twice (the corresponding problems are underlined).

Monocarp wants to get excited exactly $k$ times during his practicing session. Help him to choose the order in which he has to solve the problems!

Monocarp 正在为一场大型竞赛做准备。他计划解决 $n$ 道题目，以确保自己已做好充分准备。这些题目各自具有一个难度等级：第一道题的难度等级为 $1$，第二道题的难度等级为 $2$，依此类推，直到第 $n$ 道（即最后一道）题，其难度等级为 $n$。

Monocarp 将选择一个顺序来依次解决全部 $n$ 道题。每当他解决一道比上一道刚解决的题目更难的题目时，他就会感到兴奋，因为他觉得自己正在进步。但在他所选顺序中解决的第一道题不会使他兴奋。

例如，若 Monocarp 按照顺序 $[3, \underline{5}, 4, 1, \underline{6}, 2]$ 解题，则他会兴奋两次（对应被下划线标出的题目）。

Monocarp 希望在整个练习过程中恰好兴奋 $k$ 次。请帮他确定一个解题顺序！

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

Each test case consists of one line containing two integers $n$ and $k$ ($2 \le n \le 50$; $0 \le k \le n - 1$).

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

每个测试用例由一行组成，包含两个整数 $n$ 和 $k$（$2 \le n \le 50$；$0 \le k \le n - 1$）。

For each test case, print $n$ distinct integers from $1$ to $n$, denoting the order in which Monocarp should solve the problems. If there are multiple answers, print any of them.

It can be shown that under the constraints of the problem, the answer always exists.

对于每个测试用例，输出 $n$ 个互不相同的整数，取值范围为 $1$ 到 $n$，表示 Monocarp 应该解题的顺序。如果存在多个答案，输出任意一个即可。

在本题的约束条件下，可以证明答案一定存在。