#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:336777216")
using namespace std;
const double pi = (double)3.141592653589793238462643383279502884197169399375105;
long long MOD = (long long)1e9 + 7;
long long power(long long n, long long k) {
  if (k == 0)
    return 1;
  else if (k == 1)
    return n;
  else {
    if (k % 2 == 0)
      return power((n * n), k / 2);
    else
      return (power((n * n), k / 2) * n);
  }
}
long long modInv(long long n) { return power(n, MOD - 2); }
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
class fraction {
 public:
  long long up, down;
  fraction(long long inup, long long indown) {
    up = inup;
    down = indown;
  }
  bool operator<(const fraction &right) const {
    long long value = down * right.down;
    if (value < 0)
      return up * right.down > down * right.up;
    else
      return up * right.down < down * right.up;
  }
  bool operator!=(const fraction &right) const {
    return up * right.down != down * right.up;
  }
};
vector<pair<fraction, fraction>> arr;
vector<fraction> *segment[410000];
void build(long long l, long long r, long long index) {
  segment[index] = new vector<fraction>;
  for (int i = l - 1; i <= r - 1; i++) {
    segment[index]->push_back(arr[i].second);
  }
  sort(segment[index]->begin(), segment[index]->end());
  if (l == r)
    return;
  else {
    long long mid = (l + r) / 2;
    build(l, mid, 2 * index);
    build(mid + 1, r, 2 * index + 1);
  }
}
long long cal(long long l, long long r, long long index, long long s,
              fraction val) {
  if (s >= r) return 0;
  if (l > s) {
    auto it = upper_bound(segment[index]->begin(), segment[index]->end(), val);
    return &(*it) - &(*segment[index]->begin());
  } else {
    long long mid = (l + r) / 2;
    long long value = 0;
    if (mid <= s) {
      value += cal(mid + 1, r, 2 * index + 1, s, val);
    } else {
      value += cal(l, mid, 2 * index, s, val);
      value += cal(mid + 1, r, 2 * index + 1, s, val);
    }
    return value;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, w;
  cin >> n >> w;
  for (int i = 0; i < n; i++) {
    long long a, b;
    cin >> a >> b;
    fraction fr(-a, b - w);
    fraction to(-a, b + w);
    arr.push_back({fr, to});
  }
  sort(arr.begin(), arr.end());
  vector<fraction> helper;
  for (int i = 0; i < n; i++) {
    helper.push_back(arr[i].first);
  }
  build(1, n, 1);
  long long answer = 0;
  long long cnt = 1;
  for (int i = 0; i < n - 1; i++) {
    auto it = upper_bound(&helper[i + 1], &helper[n], arr[i].first);
    long long s = &(*it) - &(helper[0]) - 1;
    answer += s - i;
    answer += cal(1, n, 1, s + 1, arr[i].second);
  }
  answer += ((cnt) * (cnt - 1)) / 2;
  cout << answer;
  return 0;
}
