Permutation Construct

A permutation of length $N$ is an array of length $N$ that contains every integer from $1$ to $N$ exactly once. Given $N$ and $K$, find a permutation $P$ of length $N$ satisfying the following constraints: - $P_i \ne i$ for all $1 \le i \le N$ - $P_i \bmod K = i \bmod K$ for all $1 \le i \le N$ In case no such permutation exists, output $-1$ instead. ### Input - The first line of input will co