#include <bits/stdc++.h>
using namespace std;
int n, w;
long long ans;
double a[100010], b[100010];
struct SDY {
  int f, x, v;
  double a, b;
  bool operator<(const SDY B) const { return a < B.a || (a == B.a && b > B.b); }
} sh[100010];
void msort(int l, int r) {
  if (l == r) return;
  int mid = (l + r) / 2;
  msort(l, mid);
  msort(mid + 1, r);
  int ll = l, rr = mid + 1, now = 0;
  while (ll <= mid && rr <= r) {
    if (a[ll] < a[rr])
      b[++now] = a[ll++];
    else
      b[++now] = a[rr++], ans += (long long)mid - ll + 1;
  }
  for (int i = ll; i <= mid; i++) b[++now] = a[i];
  for (int i = rr; 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", &sh[i].x, &sh[i].v);
    if (sh[i].x > 0) sh[i].f = 1;
  }
  for (int i = 1; i <= n; i++) {
    if (sh[i].f == 0) {
      sh[i].a = abs((sh[i].x * 1.0) / ((sh[i].v + w) * 1.0));
      sh[i].b = abs((sh[i].x * 1.0) / ((sh[i].v - w) * 1.0));
    } else {
      sh[i].b = abs((sh[i].x * 1.0) / ((sh[i].v - w) * 1.0));
      sh[i].a = abs((sh[i].x * 1.0) / ((sh[i].v + w) * 1.0));
    }
  }
  sort(sh + 1, sh + 1 + n);
  for (int i = 1; i <= n; i++) a[i] = sh[i].b;
  msort(1, n);
  printf("%lld\n", ans);
  return 0;
}
