Construct Permutation

You are given integers $N$ and $K$. Find a permutation $P$ of length $N$ such that: - $\sum_{i=1}^{N} ( \max\limits_{j = 1}^{i} P_j - \min\limits_{j = 1}^{i} P_j ) = K$ If there exists multiple $P$, you can print any one. Otherwise report that it is not possible. Note that a permutation of length $N$ consists of all integers from $1$ to $N$ exactly once. ### Input - The first line contains a