A10160 | BCPC

In the first line of the input three integers $n$ , $c$ and $d$ ( $3<=n<=345678,1<=c,d<=10^{9}$ ) 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^{9},|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.

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

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)$ .