Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tags yet

No tag edit access

D. Contact ATC

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputArkady the air traffic controller is now working with *n* planes in the air. All planes move along a straight coordinate axis with Arkady's station being at point 0 on it. The *i*-th plane, small enough to be represented by a point, currently has a coordinate of *x*_{i} and is moving with speed *v*_{i}. It's guaranteed that *x*_{i}·*v*_{i} < 0, i.e., all planes are moving towards the station.

Occasionally, the planes are affected by winds. With a wind of speed *v*_{wind} (not necessarily positive or integral), the speed of the *i*-th plane becomes *v*_{i} + *v*_{wind}.

According to weather report, the current wind has a steady speed falling inside the range [ - *w*, *w*] (inclusive), but the exact value cannot be measured accurately since this value is rather small — smaller than the absolute value of speed of any plane.

Each plane should contact Arkady at the exact moment it passes above his station. And you are to help Arkady count the number of pairs of planes (*i*, *j*) (*i* < *j*) there are such that there is a possible value of wind speed, under which planes *i* and *j* contact Arkady at the same moment. This value needn't be the same across different pairs.

The wind speed is the same for all planes. You may assume that the wind has a steady speed and lasts arbitrarily long.

Input

The first line contains two integers *n* and *w* (1 ≤ *n* ≤ 100 000, 0 ≤ *w* < 10^{5}) — the number of planes and the maximum wind speed.

The *i*-th of the next *n* lines contains two integers *x*_{i} and *v*_{i} (1 ≤ |*x*_{i}| ≤ 10^{5}, *w* + 1 ≤ |*v*_{i}| ≤ 10^{5}, *x*_{i}·*v*_{i} < 0) — the initial position and speed of the *i*-th plane.

Planes are pairwise distinct, that is, no pair of (*i*, *j*) (*i* < *j*) exists such that both *x*_{i} = *x*_{j} and *v*_{i} = *v*_{j}.

Output

Output a single integer — the number of unordered pairs of planes that can contact Arkady at the same moment.

Examples

Input

5 1

-3 2

-3 3

-1 2

1 -3

3 -5

Output

3

Input

6 1

-3 2

-2 2

-1 2

1 -2

2 -2

3 -2

Output

9

Note

In the first example, the following 3 pairs of planes satisfy the requirements:

- (2, 5) passes the station at time 3 / 4 with
*v*_{wind}= 1; - (3, 4) passes the station at time 2 / 5 with
*v*_{wind}= 1 / 2; - (3, 5) passes the station at time 4 / 7 with
*v*_{wind}= - 1 / 4.

In the second example, each of the 3 planes with negative coordinates can form a valid pair with each of the other 3, totaling 9 pairs.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/16/2018 01:30:33 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|