{"raw_statement":[{"iden":"statement","content":"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.\n\nOccasionally, 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_.\n\nAccording 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.\n\nEach 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.\n\nThe wind speed is the same for all planes. You may assume that the wind has a steady speed and lasts arbitrarily long."},{"iden":"input","content":"The first line contains two integers _n_ and _w_ (1 ≤ _n_ ≤ 100 000, 0 ≤ _w_ < 105) — the number of planes and the maximum wind speed.\n\nThe _i_\\-th of the next _n_ lines contains two integers _x__i_ and _v__i_ (1 ≤ |_x__i_| ≤ 105, _w_ + 1 ≤ |_v__i_| ≤ 105, _x__i_·_v__i_ < 0) — the initial position and speed of the _i_\\-th plane.\n\nPlanes 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_."},{"iden":"output","content":"Output a single integer — the number of unordered pairs of planes that can contact Arkady at the same moment."},{"iden":"examples","content":"Input\n\n5 1\n-3 2\n-3 3\n-1 2\n1 -3\n3 -5\n\nOutput\n\n3\n\nInput\n\n6 1\n-3 2\n-2 2\n-1 2\n1 -2\n2 -2\n3 -2\n\nOutput\n\n9"},{"iden":"note","content":"In the first example, the following 3 pairs of planes satisfy the requirements:\n\n*   **(2, 5)** passes the station at time 3 / 4 with _v__wind_ = 1;\n*   **(3, 4)** passes the station at time 2 / 5 with _v__wind_ = 1 / 2;\n*   **(3, 5)** passes the station at time 4 / 7 with _v__wind_ =  - 1 / 4.\n\nIn 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."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":null,"simple_statement":null,"has_page_source":false}