Arkady 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. 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 a single integer — the number of unordered pairs of planes that can contact Arkady at the same moment. 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