#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
  return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
  return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const long long oo = 1 << 30;
const long long loo = 1ll << 62;
const long long mods = 998244353;
const long long MAXN = 200005;
const long long INF = 0x3f3f3f3f;
inline long long read() {
  long long f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
long long num = 0;
struct number {
  long long x, y;
} b[MAXN];
bool operator<(number a, number b) { return a.x * b.y < a.y * b.x; }
bool operator==(number a, number b) { return a.x * b.y == a.y * b.x; }
bool operator>(number a, number b) { return a.x * b.y > a.y * b.x; }
pair<number, number> a[MAXN];
long long s[MAXN << 2], c[MAXN], n, w;
long long query(long long x) {
  long long ans = 0;
  for (; x; x -= x & (-x)) ans += s[x];
  return ans;
}
void add(long long x, long long y) {
  for (; x <= n; x += x & (-x)) s[x] += y;
}
signed main() {
  n = read(), w = read();
  for (long long i = 1; i <= n; i++) {
    long long x = read(), y = read();
    if (y > 0)
      a[i].first = (number){-x, y - w}, a[i].second = (number){-x, y + w},
      b[i] = a[i].second;
    else
      a[i].first = (number){x, w - y}, a[i].second = (number){x, -y - w},
      b[i] = a[i].second;
  }
  sort(b + 1, b + n + 1);
  c[0] = 1;
  for (long long i = 1; i <= n; i++)
    if (b[i] == b[i - 1])
      c[i] = c[i - 1];
    else
      c[i] = c[i - 1] + 1;
  sort(a + 1, a + n + 1, [&](pair<number, number> x, pair<number, number> y) {
    return (x.first < y.first) || (x.first == y.first && x.second > y.second);
  });
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    long long t = c[lower_bound(b + 1, b + n + 1, a[i].second) - b];
    ans += query(n) - query(t - 1);
    add(t, 1);
  }
  printf("%lld\n", ans);
  return 0;
}
