#include <bits/stdc++.h>
using namespace std;
const int N = 110000;
int n, w, id[N], BIT[N];
pair<pair<double, int>, int> ary1[N];
pair<double, int> ary2[N];
void ins(int x) {
  while (x < N) {
    BIT[x]++;
    x += x & -x;
  }
}
int qry(int x) {
  int sum = 0;
  while (x) {
    sum += BIT[x];
    x -= x & -x;
  }
  return sum;
}
int main() {
  scanf("%d%d", &n, &w);
  int i;
  for (i = 1; i <= n; i++) {
    int x, v;
    scanf("%d%d", &x, &v);
    int k = x < 0 ? (N * 2 + x) : x;
    ary1[i] = make_pair(make_pair((double)abs(x) / abs(v - w), k), i);
    ary2[i] = make_pair((double)abs(x) / abs(v + w), i);
  }
  sort(ary1 + 1, ary1 + n + 1);
  for (i = 1; i <= n; i++) {
    id[ary1[i].second] = i;
  }
  for (i = 1; i <= n; i++) ary2[i].second = -id[ary2[i].second];
  sort(ary2 + 1, ary2 + n + 1);
  for (i = 1; i <= n; i++) {
    ary2[i].second = -ary2[i].second;
  }
  long long ans = 0;
  for (i = n; i >= 1; i--) {
    ans += qry(ary2[i].second);
    ins(ary2[i].second);
  }
  printf("%lld\n", ans);
}
