#include <bits/stdc++.h>
using namespace std;
vector<int> bit;
int n;
int lowbit(int x) { return x & -x; }
void inc(int x) {
  while (x <= n) {
    bit[x]++;
    x += lowbit(x);
  }
}
long long int sum(int x) {
  long long int s = 0;
  while (x > 0) {
    s += bit[x];
    x -= lowbit(x);
  }
  return s;
}
int main() {
  cin.tie(NULL);
  ios::sync_with_stdio(false);
  int w;
  while (cin >> n >> w) {
    vector<pair<double, double>> arr(n);
    for (int i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second;
    vector<pair<double, double>> v(n);
    for (int i = 0; i < n; i++) {
      v[i].first = arr[i].first / (arr[i].second + w);
      v[i].second = -arr[i].first / (arr[i].second - w);
    }
    sort(v.begin(), v.end());
    vector<pair<double, int>> a(n);
    for (int i = 0; i < n; i++) {
      a[i].first = v[i].second;
      a[i].second = i + 1;
    }
    sort(a.begin(), a.end());
    bit.clear();
    bit.resize(n + 1, 0);
    long long int ans = 0;
    for (int i = 0; i < n; i++) {
      ans += sum(a[i].second);
      inc(a[i].second);
    }
    cout << ans << '\n';
  }
  return 0;
}
