#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using pii = pair<LL, LL>;
int n;
LL w;
vector<pii> fl;
void sort_idx(vector<int>& idx, LL wind, bool fst) {
  auto cmp = [&](int a, int b) {
    LL xa = fl[a].first;
    LL xb = fl[b].first;
    LL va = fl[a].second;
    LL vb = fl[b].second;
    va += wind;
    vb += wind;
    if (xa < 0) {
      xa = -xa;
      va = -va;
    }
    if (xb < 0) {
      xb = -xb;
      vb = -vb;
    }
    LL ta = xa * vb;
    LL tb = xb * va;
    if (ta == tb) {
      va = fl[a].second;
      vb = fl[b].second;
      xa = fl[a].first;
      xb = fl[b].first;
      va -= wind;
      vb -= wind;
      if (xa < 0) {
        xa = -xa;
        va = -va;
      }
      if (xb < 0) {
        xb = -xb;
        vb = -vb;
      }
      ta = xa * vb;
      tb = xb * va;
      int ia = fst ? a : -a;
      int ib = fst ? b : -b;
      return pii(tb, ib) < pii(ta, ia);
    } else {
      return ta < tb;
    }
  };
  sort(idx.begin(), idx.end(), cmp);
}
void add(vector<int>& tree, int idx) {
  for (; idx < tree.size(); idx = idx | (idx + 1)) tree[idx]++;
}
LL get(vector<int>& tree, int idx) {
  LL res = 0;
  for (; idx >= 0; idx = (idx & (idx + 1)) - 1) res += tree[idx];
  return res;
}
LL calc_inv(vector<int>& a) {
  const int n = a.size();
  vector<int> idx(n);
  for (int i = 0; i < n; ++i) {
    idx[i] = i;
  }
  sort(idx.begin(), idx.end(), [&](int x, int y) { return a[x] > a[y]; });
  vector<int> tree(n, 0);
  LL res = 0;
  for (int i = 0; i < n; ++i) {
    res += get(tree, idx[i]);
    add(tree, idx[i]);
  }
  return res;
}
LL solve() {
  cin >> n >> w;
  fl.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> fl[i].first >> fl[i].second;
  }
  vector<int> idx1(n), idx2(n);
  for (int i = 0; i < n; ++i) {
    idx1[i] = idx2[i] = i;
  }
  sort_idx(idx1, -w, true);
  sort_idx(idx2, w, false);
  vector<int> idx1_pos(n);
  for (int i = 0; i < n; ++i) idx1_pos[idx1[i]] = i;
  for (int i = 0; i < n; ++i) idx2[i] = idx1_pos[idx2[i]];
  return calc_inv(idx2);
}
int main() {
  std::ios_base::sync_with_stdio(false);
  for (int t = 0; t < 1; ++t) {
    cout << solve() << endl;
  }
}
