#include <bits/stdc++.h>
using namespace std;
const int N = 100003, SZ = 30;
const long double eps = 0.000001;
const int INF = (int)1e9;
const long long LINF = 1e18;
const int MOD = 10000;
const double PI = acos(-1.0);
int n, w;
int x[N], v[N];
vector<pair<pair<long long, long long>, int> > v1, v2;
int p[N];
long long f[N];
bool cmp2(pair<pair<long long, long long>, int> a,
          pair<pair<long long, long long>, int> b) {
  if (a.first.first * b.first.second == a.first.second * b.first.first) {
    int id1 = a.second, id2 = b.second;
    return v1[id1].first.first * v1[id2].first.second >
           v1[id1].first.second * v1[id2].first.first;
  }
  return a.first.first * b.first.second < a.first.second * b.first.first;
}
bool cmp1(pair<pair<long long, long long>, int> a,
          pair<pair<long long, long long>, int> b) {
  if (a.first.first * b.first.second == a.first.second * b.first.first) {
    int id1 = a.second, id2 = b.second;
    return p[id1] > p[id2];
  }
  return a.first.first * b.first.second < a.first.second * b.first.first;
}
void add(int pos, int val) {
  while (pos < n) {
    f[pos] += val;
    pos = pos + 1 | pos;
  }
}
long long sum(int pos) {
  long long s = 0;
  while (pos >= 0) {
    s += f[pos];
    pos = (pos + 1 & pos) - 1;
  }
  return s;
}
int main() {
  ios::sync_with_stdio();
  cin.tie(0), cout.tie(0);
  cin >> n >> w;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> v[i];
  }
  v1.resize(n);
  v2.resize(n);
  for (int i = 0; i < n; i++) {
    v1[i].first.first = abs(x[i]), v1[i].first.second = abs(v[i] - w);
    v1[i].second = i;
  }
  for (int i = 0; i < n; i++) {
    v2[i].first.first = abs(-x[i]), v2[i].first.second = abs(v[i] + w);
    v2[i].second = i;
  }
  sort(v2.begin(), v2.end(), cmp2);
  for (int i = 0; i < n; i++) {
    p[v2[i].second] = i;
  }
  sort(v1.begin(), v1.end(), cmp1);
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    int id = p[v1[i].second];
    ans += sum(n - 1) - sum(id);
    add(id, 1);
  }
  cout << ans;
}
