BCPC

4000ms

262144K

Description:

BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in Byteforces.

BCPC is a team competition. Each team is composed by a coach and three contestants. Blenda is the coach of the Bit State University(BSU), and she is very strict selecting the members of her team.

$\text{[math]}$

In BSU there are n students numbered from 1 to n. Since all BSU students are infinitely smart, the only important parameters for Blenda are their reading and writing speed. After a careful measuring, Blenda have found that the i-th student have a reading speed equal to r_i (words per minute), and a writing speed of w_i (symbols per minute). Since BSU students are very smart, the measured speeds are sometimes very big and Blenda have decided to subtract some constant value c from all the values of reading speed and some value d from all the values of writing speed. Therefore she considers r_i' = r_i - c and w_i' = w_i - d.

The student i is said to overwhelm the student j if and only if r_i'·w_j' > r_j'·w_i'. Blenda doesn’t like fights in teams, so she thinks that a team consisting of three distinct students i, j and k is good if i overwhelms j, j overwhelms k, and k overwhelms i. Yes, the relation of overwhelming is not transitive as it often happens in real life.

Since Blenda is busy preparing a training camp in Codeforces, you are given a task to calculate the number of different good teams in BSU. Two teams are considered to be different if there is at least one student that is present in one team but is not present in the other. In other words, two teams are different if the sets of students that form these teams are different.

Input:

In the first line of the input three integers n, c and d (3 ≤ n ≤ 345678, 1 ≤ c, d ≤ 10⁹) are written. They denote the number of students Blenda can use to form teams, the value subtracted from all reading speeds and the value subtracted from all writing speeds respectively.

Each of the next n lines contains two integers r_i and w_i (0 < r_i, w_i ≤ 10⁹, |r_i - c| + |w_i - d| > 0). There are no two students, such that both their reading and writing speeds coincide, i.e. for every i ≠ j condition |r_i - r_j| + |w_i - w_j| > 0 holds.

Output:

Print the number of different teams in BSU, that are good according to Blenda's definition.

Sample Input:

Sample Output:

Sample Input:

Sample Output:

Note:

In the first sample the following teams are good: (i = 1, j = 2, k = 3), (i = 2, j = 5, k = 1), (i = 1, j = 4, k = 3), (i = 5, j = 1, k = 4).

Note, that for example the team (i = 3, j = 1, k = 2) is also good, but is considered to be the same as the team (i = 1, j = 2, k = 3).

Informação

Provedor Codeforces

Código CF592E