Parity Permutation

You are given an array $A$ of length $N$ containing **distinct** integers and an integer $K$ (either $0$ or $1$). Your task is to find the total number of permutations of array $A$ such that for **all** pairs $(i, j)$ with $1 \leq i \lt j \leq N$, and $(i + j)$ being an **odd** number: - $(A_i+A_j) \% 2$ $= K$ You should output the count of such permutations modulo $10^9+7$. ### Input - The f