n. If there are multiple solutions, print any of them. If there is no solution, print "-1" in one line.
Roundgod is given n_{}, k_{} n ,k , construct a permutation P P of 1sim n 1∼n satisfying that for all integers i_{} i in [1, n]_{} [1,n] , there exists a contiguous subarray in P P of length i_{} i whose sum is k k modulo n n. If there are multiple solutions, print any of them. If there is no solution, print "-1" in one line.
（图片来源网络，侵删）
