Pair Sum Divisibility

Input

The first line contains the integers $n$ and k~(2 \le n, k \le 100). The second line contains $n$ integers — the elements of the array A = (a_0, a_1, ..., a_{n-1}), where 1 \le a_i \le 100.

Output

Print the number of pairs $(i,j)$ such that i < j and a_i + a_j is divisible by $k$.

Esempi