"Money doesn't matter." ~by rich people

"Looks doesn't matter." ~by Attractive people

"Bugs doesn't matter." ~by programmer

You are programmer, you have no life and you need to figure out some problem without creating bugs.

Given n numbers $a_i$ $(0 \leq i < n)$, and integer k.

You can concatenate two number $a_i$, $a_j$ $(i \neq j)$ into either $a_ia_j$ or $a_ja_i$.

You need to figure out how many ways are there to concatenate two number such that the concatenation of two numbers is divisible by k.

Example

n = 6, k = 11

$\{a_i, (0 \leq i < 6)\} = \{45,1,10,12,11,7\}$

you can concatenate $45,1$ into $451$ , is divisible by 11.

you can concatenate $45,10$ into $4510$ , is divisible by 11.

you can concatenate $10,45$ into $1045$ , is divisible by 11.

you can concatenate $1,10$ into $110$ , is divisible by 11.

you can concatenate $10,12$ into $1012$ , is divisible by 11.

you can concatenate $12,1$ into $121$ , is divisible by 11.

you can concatenate $12,10$ into $1210$ , is divisible by 11.

There are 7 ways to concatenate two number which is divisible by 11.

Hence the answer is 7.

The input end with EOF, there will be at most 3 testcases.

For each testcase,

the first line contains two integer n ($1 \leq n \leq 2\times 10^5$) , k $(2 \leq k \leq 10^9)$

the second line contains n integer $a_i$ ($1 \leq a_i \leq 10^9$)