I. Impressing the Captain
time limit per test
1.5 s
memory limit per test
256 megabytes
input
standard input
output
standard output

Vieira is such a good math student that some of his superiors took notice of this skill. Captain Shoba was really impressed by the calculations that he was able to do, and so whenever he could, he'd try to test Vieira's skills. Usually, the captain would give Vieira an array and an integer $$$x$$$; Vieira would promptly say the indices of two numbers whose multiplication would result in $$$x$$$.

Since he was responding to the captain's queries in less than one femtosecond, the captain thought of another way to test him. Now, instead of saying two indices, Vieira would have to discover how many pairs of indices exist so that the multiplication of the numbers results in $$$x$$$. He's tired of the captain's shenanigans and asks you to make a program to respond for him.

Input

The first line contains two integers, $$$n$$$, $$$x$$$, $$$(1 \leq n \leq 10^6)$$$, $$$(1 \leq x \leq 10^8)$$$ — the length of the array and the number that should be multiplied to.

The second line contains $$$n$$$ integers $$$a_i$$$ $$$(1 \leq a_i \leq 10^4)$$$ — the array $$$a$$$.

Output

Print a single integer — the number of pairs $$$i$$$, $$$j$$$, $$$(1 \leq i \lt j \leq n)$$$, such that $$$a_i \times a_j = x$$$.

Example
Input
4 10
5 2 3 5
Output
2