There are $n$ nonnegative integers $a_{1...n}$ which are less than $p$. HazelFan wants to know how many pairs $i,j(1\leq i\leq>

The first line contains a positive integer $T(1\leq T\leq5)$, denoting the number of test cases.
For each test case:
The first line contains two positive integers $n,p(1\leq n\leq10^5,2\leq p\leq10^{18})$, and it is guaranteed that $p$ is a prime number.
The second line contains $n$ nonnegative integers $a_{1...n}(0\leq a_i

)$.<>

For each test case:
A single line contains a nonnegative integer, denoting the answer.