Permutation Mod K

A permutation $P_1, P_2, .... P_N$ is called good if $P_i \mod K \ne i \mod K$ for all $1 \le i \le N$. Given the values of $N$ and $K$, find a good permutation, or claim it does not exist. A permutation of length $N$ contains each of the values $1, 2, ...N$ exactly once. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case c