#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
struct Node {
  int f, x, v;
  double a, b;
};
int n, w;
double a[N], b[N];
Node node[N];
long long ans;
bool cmp(const Node& x, const Node& y) {
  if (x.a != y.a) return x.a < y.a;
  return x.b > y.b;
}
void msort(int l, int r) {
  if (l == r) return;
  int mid = (l + r) / 2;
  msort(l, mid);
  msort(mid + 1, r);
  int _l, _r, now;
  now = 0;
  _l = l;
  _r = mid + 1;
  while (_l <= mid && _r <= r) {
    if (a[_l] < a[_r]) {
      b[++now] = a[_l++];
    } else {
      b[++now] = a[_r++];
      ans += (long long)mid - _l + 1;
    }
  }
  for (int i = _l; i <= mid; ++i) b[++now] = a[i];
  for (int i = _r; i <= r; ++i) b[++now] = a[i];
  for (int i = 1; i <= now; ++i) a[l + i - 1] = b[i];
}
int main() {
  scanf("%d%d", &n, &w);
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &node[i].x, &node[i].v);
    if (node[i].x > 0) node[i].f = 1;
  }
  for (int i = 1; i <= n; ++i) {
    if (node[i].f == 0) {
      node[i].a = abs((node[i].x * 1.0) / ((node[i].v + w) * 1.0));
      node[i].b = abs((node[i].x * 1.0) / ((node[i].v - w) * 1.0));
    } else {
      node[i].b = abs((node[i].x * 1.0) / ((node[i].v - w) * 1.0));
      node[i].a = abs((node[i].x * 1.0) / ((node[i].v + w) * 1.0));
    }
  }
  sort(node + 1, node + 1 + n, cmp);
  for (int i = 1; i <= n; ++i) a[i] = node[i].b;
  msort(1, n);
  printf("%lld\n", ans);
}
