You are given several pairwise distinct Archimedean spirals on a two-dimensional plane. All the spirals start at the origin and leave it along the vector $$$(1, 0)$$$.
The $$$i$$$-th spiral is characterized by a nonzero integer $$$d_i$$$: it increases its distance to the origin by $$$|d_i|$$$ while making a full revolution, and it winds counterclockwise if $$$d_i \gt 0$$$ and clockwise if $$$d_i \lt 0$$$.
Formally, a spiral with parameter $$$d$$$ consists of the points $$$\left( r \cos \frac{2\pi r}{d},\ r \sin \frac{2\pi r}{d} \right)$$$ for all $$$r \geq 0$$$.
Find the number of pairwise intersections of these spirals at a distance of at most $$$R$$$ from the origin. If an intersection point belongs to more than two spirals, it is counted multiple times: once per each unordered pair of these spirals. Note that the origin is an intersection point of all given spirals.
The first line contains two integers $$$n$$$ and $$$R$$$ ($$$1 \leq n \leq 2 \cdot 10^5$$$, $$$1 \leq R \leq 10^9$$$): the number of spirals and the maximum distance from the origin.
The second line contains $$$n$$$ integers $$$d_1, d_2, \ldots, d_n$$$ ($$$-10^9 \leq d_i \leq 10^9$$$, $$$d_i \neq 0$$$): the parameters of the spirals.
It is guaranteed that $$$d_1, d_2, \ldots, d_n$$$ are pairwise distinct.
Print the number of pairwise spiral intersections located within distance $$$R$$$ from the origin.
2 62 3
2
3 66 -2 -3
11
Illustrations for both examples (note that some points may be counted several times):
| Name |
|---|


