Perfect Permutation

An index $i$ in a permutation $P$ of length $N$ is said to be *good* if: - $P_i$ is divisible by $i$ You are given $2$ integers $N$ and $K$. You need to construct a permutation $P$ of length $N$ such that **exactly** $K$ indices in that permutation are good. If no such permutation exists, output $-1$. If multiple such permutations exist, output any. ### Input - The first line contains a single