Triangles

아직 제출이 없습니다시간 제한10초메모리 제한256 MB

문제

nn points are given on a plane. We are interested in the number of right-angled triangles with vertices at these points and area contained in the range \[A,B]\[A,B].

입력

The first line contains three integers nn, AA, BB (1n20001\leq n\leq 2000, 1AB10181\leq A\leq B\leq 10^{18}). The following nn lines describe the individual points. The ii-th of these lines contains two integers x_i,y_ix\_i,y\_i (109x_i,y_i109-10^9\leq x\_i,y\_i\leq 10^9) which are the coordinates of the ii-th point. All the given points are distinct.

출력

The only line of the output should contain the number of triangles with vertices at the given points and area in the range \[A,B]\[A,B].

힌트