You are given an array $A=\{a_0,a_1...a_{N-1}\}$ and an integer D. Find the total number of un-ordered pairs $(i,j)$ where $i\ne j$ such that $a_i\ast a_j\equiv 0(\mathrm{mod}D)$.

INPUT

The first line of each test file contains two space separated integers N and D, where N denotes the size of array A and D is as described above. Next line contains N space separated integers $a_0\dots a_{N-1}$ denoting array A .

OUTPUT

Output a single line containing the number of pairs as described in problem statement.

CONSTRAINTS

• $1\le N\le {10}^6$
  
• $1\le D\le {10}^6$
  
• $1\le a_i\le {10}^9$