#include <bits/stdc++.h>
using namespace std;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et() {
  puts("-1");
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) {
  long long z = y;
  while (x % y != 0) {
    z = x % y;
    x = y;
    y = z;
  }
  return z;
}
int w, x[100005], v[100005];
struct Frac {
  long long x, y;
  Frac() {}
  Frac(long long x, long long y) : x(x), y(y) {}
  long double abs() const { return (long double)x / y; }
  void uni() {
    if (y < 0) {
      y *= -1;
      x *= -1;
    }
  }
  Frac operator*(Frac o) const { return Frac(x * o.x, y * o.y); }
  Frac operator+(const Frac& o) const {
    return Frac(x * o.y + y * o.x, y * o.y);
  }
  Frac operator-(const Frac& o) const {
    return Frac(x * o.y - y * o.x, y * o.y);
  }
  bool operator<(const Frac& o) const { return x * o.y < y * o.x; }
  friend bool operator==(const Frac& r1, const Frac& r2) {
    return r1.x * r2.y == r1.y * r2.x;
  }
};
vector<Frac> vp;
int l[100005], r[100005];
int b[100005 << 1];
void update(int x) {
  for (int i = x; i <= n + n; i += i & -i) {
    b[i]++;
  }
}
int query(int x) {
  int ret = 0;
  for (; x > 0; ret += b[x], x -= x & -x)
    ;
  return ret;
}
void fmain(int ID) {
  scanf("%d%d", &n, &w);
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    scanf("%d%d", x + i, v + i);
    if (x[i] < 0) {
      vp.push_back({-x[i], v[i] + w});
      vp.push_back({-x[i], v[i] - w});
    } else {
      vp.push_back({x[i], -v[i] + w});
      vp.push_back({x[i], -v[i] - w});
    }
  }
  sort(vp.begin(), vp.end());
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    if (x[i] < 0) {
      r[i] = lower_bound(vp.begin(), vp.end(), Frac(-x[i], v[i] + w)) -
             vp.begin() + 1;
      l[i] = lower_bound(vp.begin(), vp.end(), Frac(-x[i], v[i] - w)) -
             vp.begin() + 1;
    } else {
      l[i] = lower_bound(vp.begin(), vp.end(), Frac(x[i], -v[i] + w)) -
             vp.begin() + 1;
      r[i] = lower_bound(vp.begin(), vp.end(), Frac(x[i], -v[i] - w)) -
             vp.begin() + 1;
    }
  }
  vector<pair<int, int> > tv;
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    tv.push_back({-l[i], r[i]});
  }
  sort(tv.begin(), tv.end());
  long long ans = 0;
  for (int i = 0, j; i < n; i = j) {
    for (j = i; j < n && tv[i].first == tv[j].first; j++)
      ;
    ans += (long long)(j - i) * (j - i - 1) / 2;
    for (int k = i; k < j; k++) {
      ans += query(tv[k].second);
    }
    for (int k = i; k < j; k++) {
      update(tv[k].second);
    }
  }
  printf("%lld\n", ans);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
