Huh? Can't hear you

Hyunbin and Sooyeon live on a two-dimensional coordinate plane. Both use old phones, so their calls often drop. While moving around and talking, they found that the call does not drop when the slope of the line connecting their positions is $K$.

Given $N$ coordinates where Hyunbin and Sooyeon may live, count the number of ways to place them so that the call does not drop.

The first line contains $N$ and $K$, separated by a space. ($2 \le N \le 200000$, $-10^9 \le K \le 10^9$)

The next $N$ lines contain the $x$ and $y$ coordinates of point $i$, separated by a space. ($-10^9 \le x_i, y_i \le 10^9$)

No coordinate is given more than once, and all values in the input are integers.

Print the number of ways to place Hyunbin and Sooyeon so that the call does not drop.