#include <bits/stdc++.h>
using namespace std;
struct TT {
  int id;
  double x, v;
  bool operator<(const TT &b) const { return (fabs(x * b.v) < fabs(b.x * v)); }
} s[100005];
int a[100005], b[100005], c[100005], n;
double w;
void update(int v, int data) {
  while (v <= n) {
    c[v] += data;
    v += v & -v;
  }
}
int getsum(int v) {
  int sum = 0;
  while (v > 0) {
    sum += c[v];
    v -= v & -v;
  }
  return sum;
}
int main() {
  scanf("%d%lf", &n, &w);
  w += 1e-6;
  for (int i = 1; i <= n; i++) {
    scanf("%lf%lf", &s[i].x, &s[i].v);
    s[i].id = i;
    s[i].v -= w;
  }
  sort(s + 1, s + n + 1);
  for (int i = 1; i <= n; i++) a[i] = s[i].id;
  for (int i = 1; i <= n; i++) s[i].v += w * 2;
  sort(s + 1, s + n + 1);
  for (int i = 1; i <= n; i++) b[s[i].id] = i;
  memset(c, 0, sizeof(c));
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += i - 1 - getsum(b[a[i]]);
    update(b[a[i]], 1);
  }
  printf("%I64d\n", ans);
  return 0;
}
