K. Wala matgeesh bra7tek howa enty hatzeleniiiii
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Baraa was watching a series called "Fahd el Batal" on television with his grandpa when he suddenly got an idea for an interesting problem. You are given an array $$$a$$$ of length $$$n$$$ and two integers $$$x$$$ and $$$y$$$. Count the number of pairs $$$(i, j)$$$ with $$$1 ≤ i \lt j ≤ n$$$ such that $$$x ≤ gcd(a_i, a_j)$$$.

When Baraa gave the problem to Ziad, Fady — as usual — argued and changed it to counting pairs $$$(i, j)$$$ with $$$lcm(a_i, a_j) ≤ y,$$$ but Baraa refused. So Ziad — as usual — used his wisdom to end the argument and declared that the task should be to count pairs $$$(i, j)$$$ with $$$1 ≤ i \lt j ≤ n$$$ satisfying $$$x ≤ gcd(a_i, a_j) ≤ lcm(a_i, a_j) ≤ y.$$$

Baraa is too d3eef to solve this problem, so he asks you to solve it.

Input

The first line contains three integers $$$n$$$, $$$x$$$, and $$$y$$$ ($$$1 \le n, x, y \le 10^5$$$) — the size of the array, and the parameters described in the statement.

The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^5$$$), representing the elements of the array $$$a$$$.

Output

Print a single integer — the number of pairs $$$(i, j)$$$ ($$$1 \le i \lt j \le n$$$) that satisfy $$$x \le gcd(a_i, a_j) \le \operatorname{lcm}(a_i, a_j) \le y.$$$

Example
Input
10 1 10
1 2 3 4 5 6 7 8 9 10
Output
19