Odd Split

For an array $B$ consisting of **distinct** integers, its number of inversions is equal to the number of pairs $(i, j)$ with $1\le i < j \le M$ such that $B_i > B_j$, where $M$ is the size of $B$. If this number is odd, we will call array $B$ **odd**. Otherwise, we will call it **even**. Let's call a permutation $P$ of integers from $1$ to $K$ **good**, if there exists a way to split it into two