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