#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n;
long long ans = 0;
double x[N], v[N], w, a[N], k[N];
pair<double, double> p[N];
double f(int i, int wv) { return -x[i] / (v[i] + wv); }
void m_sort(long long l, long long r) {
  long long mid = (l + r) >> 1;
  if (l == r) return;
  m_sort(l, mid);
  m_sort(mid + 1, r);
  long long i = l, j = mid + 1;
  long long now = l - 1;
  while (i <= mid && j <= r) {
    if (a[i] < a[j])
      k[++now] = a[i], i++;
    else {
      ans += mid - i + 1;
      k[++now] = a[j];
      j++;
    }
  }
  while (i <= mid) k[++now] = a[i], i++;
  while (j <= r) k[++now] = a[j], j++;
  for (int i = l; i <= r; i++) a[i] = k[i];
}
bool cmp(pair<double, double> y, pair<double, double> z) {
  return (y.first == z.first ? y.second > z.second : y.first < z.first);
}
int main() {
  scanf("%d%lf", &n, &w);
  for (int i = 1; i <= n; i++) {
    scanf("%lf%lf", &x[i], &v[i]);
  }
  for (int i = 1; i <= n; i++) {
    p[i] = make_pair(f(i, w), f(i, -w));
  }
  sort(p + 1, p + n + 1, cmp);
  for (int i = 1; i <= n; i++) a[i] = p[i].second;
  m_sort(1, n);
  cout << ans << endl;
}
