#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1 &first, T2 second) {
  if (first > second) first = second;
}
template <typename T1, typename T2>
inline void chkmax(T1 &first, T2 second) {
  if (first < second) first = second;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
  _out << _p.first << ' ' << _p.second;
  return _out;
}
template <typename T, typename U>
inline istream &operator>>(istream &_in, pair<T, U> &_p) {
  _in >> _p.first >> _p.second;
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
  if (_v.empty()) {
    return _out;
  }
  _out << _v.front();
  for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline istream &operator>>(istream &_in, vector<T> &_v) {
  for (auto &_i : _v) {
    _in >> _i;
  }
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const set<T> &_s) {
  if (_s.empty()) {
    return _out;
  }
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const multiset<T> &_s) {
  if (_s.empty()) {
    return _out;
  }
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) {
  if (_s.empty()) {
    return _out;
  }
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) {
  if (_s.empty()) {
    return _out;
  }
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
  if (_m.empty()) {
    return _out;
  }
  _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
  for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) {
    _out << ", (" << _it->first << ": " << _it->second << ')';
  }
  return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) {
  if (_m.empty()) {
    return _out;
  }
  _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
  for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) {
    _out << ", (" << _it->first << ": " << _it->second << ')';
  }
  return _out;
}
const string FILENAME = "input";
const int MAXN = 1e5 + 15;
int n, w;
int first[MAXN], v[MAXN];
pair<long long, long long> t1[MAXN], t2[MAXN];
int p[MAXN];
vector<int> id;
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return a.first * b.second < b.first * a.second;
}
bool eq(pair<long long, long long> a, pair<long long, long long> b) {
  return a.first * b.second == b.first * a.second;
}
bool cmp1(int i, int j) {
  if (eq(t1[i], t1[j])) {
    return cmp(t2[j], t2[i]);
  }
  return cmp(t1[i], t1[j]);
}
bool cmp2(int i, int j) {
  if (eq(t2[i], t2[j])) {
    return cmp(t1[j], t1[i]);
  }
  return cmp(t2[i], t2[j]);
}
struct fen {
  int a[MAXN];
  void add(int i) {
    while (i < MAXN) {
      ++a[i];
      i |= (i + 1);
    }
  }
  int get(int i) {
    int ans = 0;
    while (i > 0) {
      ans += a[i];
      i &= (i + 1);
      --i;
    }
    return ans;
  }
};
long long ans = 0;
fen box;
int main() {
  srand(time(0));
  ios::sync_with_stdio(false);
  cin >> n >> w;
  for (int i = 0; i < n; ++i) {
    cin >> first[i] >> v[i];
    t1[i].first = abs(first[i]);
    t1[i].second = abs(v[i] - w);
    t2[i].first = abs(first[i]);
    t2[i].second = abs(v[i] + w);
    id.push_back(i);
  }
  sort(id.begin(), id.end(), cmp1);
  if (w == 0) {
    int lst = 1;
    for (int i = 1; i < n; ++i) {
      if (eq(t1[id[i - 1]], t1[id[i]])) {
        ans += lst;
        ++lst;
      } else {
        lst = 1;
      }
    }
    cout << ans << endl;
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    p[id[i]] = i;
  }
  sort(id.begin(), id.end(), cmp2);
  for (int i = 0; i < n; ++i) {
    ans += i - box.get(p[id[i]]);
    box.add(p[id[i]]);
  }
  cout << ans << endl;
}
