#include <bits/stdc++.h>
using namespace std;
vector<pair<double, double> > v;
pair<double, double> xv[100001];
int n;
double w, y[100001], epsi = 0.000000001;
struct bitree {
  int *tree, n;
  bitree(int num) {
    tree = (int *)malloc((num + 1) * sizeof(int));
    n = num;
    memset(tree, 0, (n + 1) * sizeof(int));
  }
  void update(int pos, int val) {
    while (pos <= n) {
      tree[pos] += val;
      pos += (pos & (-pos));
    }
  }
  int get(int r) {
    int res = 0;
    while (r > 0) {
      res += tree[r];
      r -= (r & (-r));
    }
    return res;
  }
  ~bitree() { delete tree; }
};
void debug(int k) { cout << v[k].first << ' ' << v[k].second << endl; }
long long cal() {
  sort(v.begin(), v.end());
  sort(y + 1, y + n + 1);
  long long res = 0;
  map<double, int> match;
  int temp = 0, count = 1;
  bitree bt(n);
  for (int i = 1; i <= n; ++i)
    if (match[y[i]] == 0) match[y[i]] = ++temp;
  for (int i = 1; i <= n - 1; ++i) {
    if (v[i].first == v[i - 1].first)
      res += count++;
    else {
      for (int j = i - 1; j >= 0; --j) {
        if (v[j].first != v[i - 1].first) break;
        bt.update(match[v[j].second], 1);
      }
      count = 1;
    }
    res += i + 1 - count - bt.get(match[v[i].second] - 1);
  }
  return res;
}
void setup() {
  cin >> n >> w;
  for (int i = 1; i <= n; ++i) cin >> xv[i].first >> xv[i].second;
}
void process() {
  for (int i = 1; i <= n; ++i) {
    double t1 = (-xv[i].first) / (xv[i].second - w),
           t2 = (-xv[i].first) / (xv[i].second + w);
    v.push_back({t1, t2});
    y[i] = t2;
  }
  cout << cal();
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  setup();
  process();
  return 0;
}
