Count Arrays

Given an array $A$ of length $N$ such that $1 \leq A_i \leq N$ and $A_i \neq i,$ $\forall i \in [1, N]$. Count the number of arrays $B$ of length $N$ such that $\forall i \in [1, N]$: - $B_i \neq B_{A_i}$ - $1 \leq B_i \leq M$ Since the answer may be large, print it modulo $10^9+7$. ### Input - The first line contains a single integer $T$ − the number of test cases. The description of $T$ test