#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7fffffff;
const double eps = 1e-6;
const double pi = acos(-1.0);
inline int read() {
  int x = 0, f = 1;
  char ch;
  ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = 0;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch & 15);
    ch = getchar();
  }
  if (f)
    return x;
  else
    return -x;
}
const int N = 100010;
struct Point {
  int id;
  double x, v;
} p[N];
inline bool operator<(const Point &a, const Point &b) {
  return fabs(a.x * b.v) < fabs(a.v * b.x);
}
int n, s[N], t[N];
double w;
struct Binary_Indexed_Tree {
  long long sum[N];
  void add(int i, long long c) {
    for (; i <= n; i += ((i) & (-i))) sum[i] += c;
  }
  long long query(int i) {
    long long ans = 0;
    for (; i; i -= ((i) & (-i))) ans += sum[i];
    return ans;
  }
} Bit;
int main() {
  n = read();
  w = 1.0 * read() + eps;
  for (int i = 1; i <= n; i++)
    p[i].id = i, p[i].x = 1.0 * read(), p[i].v = 1.0 * read() - w;
  sort(p + 1, p + n + 1);
  for (int i = 1; i <= n; i++) s[i] = p[i].id;
  for (int i = 1; i <= n; i++) p[i].v += w * 2.0;
  sort(p + 1, p + n + 1);
  for (int i = 1; i <= n; i++) t[p[i].id] = i;
  long long ans = 0ll;
  for (int i = 1; i <= n; i++) {
    ans += 1ll * i - 1ll - Bit.query(t[s[i]]);
    Bit.add(t[s[i]], 1);
  }
  printf("%I64d\n", ans);
  return 0;
}
