#include <bits/stdc++.h>
using namespace std;
int n, w, len, val[100005], c[100005];
double p[100005];
struct node {
  double t1, t2;
  bool operator<(const node &b) const {
    return t1 == b.t1 ? t2 > b.t2 : t1 < b.t1;
  }
} a[100005];
int ask(int x) {
  int ret = 0;
  while (x) {
    ret += c[x];
    x -= x & -x;
  }
  return ret;
}
void add(int x) {
  while (x <= len) {
    c[x]++;
    x += x & -x;
  }
}
int main() {
  scanf("%d%d", &n, &w);
  for (int x, v, i = 1; i <= n; i++) {
    scanf("%d%d", &x, &v);
    a[i] = (node){1.0 * (v - w) / x, 1.0 * (v + w) / x};
  }
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) p[i] = a[i].t2;
  sort(p + 1, p + 1 + n);
  len = unique(p + 1, p + 1 + n) - p - 1;
  for (int i = 1; i <= n; i++)
    val[i] = lower_bound(p + 1, p + 1 + len, a[i].t2) - p;
  long long ans = 0;
  for (int i = n; i >= 1; i--) {
    ans += ask(val[i]);
    add(val[i]);
  }
  printf("%I64d", ans);
  return 0;
}
