#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll  _mergeSort(ll arr[], ll temp[], ll left, ll right);
ll merge(ll arr[], ll temp[], ll left, ll mid, ll right);
ll mergeSort(ll arr[], ll array_size)
{
    ll *temp = (ll *)malloc(sizeof(ll)*array_size);
    return _mergeSort(arr, temp, 0, array_size - 1);
}
ll _mergeSort(ll arr[], ll temp[], ll left, ll right)
{
  ll mid, inv_count = 0;
  if (right > left)
  {
    mid = (right + left)/2;
    inv_count  = _mergeSort(arr, temp, left, mid);
    inv_count += _mergeSort(arr, temp, mid+1, right);
    inv_count += merge(arr, temp, left, mid+1, right);
  }
  return inv_count;
}
ll merge(ll arr[], ll temp[], ll left, ll mid, ll right)
{
  ll i, j, k;
  ll inv_count = 0;
  i = left;
  j = mid;
  k = left;
  while ((i <= mid - 1) && (j <= right))
  {
    if (arr[i] <= arr[j])
    {
      temp[k++] = arr[i++];
    }
    else
    {
      temp[k++] = arr[j++];
      inv_count = inv_count + (mid - i);
    }
  }
  while (i <= mid - 1)
    temp[k++] = arr[i++];
  while (j <= right)
    temp[k++] = arr[j++];
  for (i=left; i <= right; i++)
    arr[i] = temp[i];

  return inv_count;
}
ll x[100009],V[100009];
ll F[100009];
main(){
    ll n, w;
    cin >> n >> w;
    vector<pair<double,double> > v;
    for(ll i = 0; i < n; i++){
        cin >> x[i] >> V[i];
        double L = 1.0* (-w)/x[i] + 1.0*V[i]/x[i];
        double R = 1.0* w/x[i] + 1.0*V[i]/x[i];
        v.push_back({L,-R});
    }
    sort(v.begin(),v.end());
    vector<pair<double,ll> > R;
    for (ll i = 0; i < v.size(); i++)
       {
        R.push_back({-v[i].second,-i});
        //cout <<v[i].first <<" "<<-v[i].second<<endl;
        }
    sort(R.begin(),R.end());
    ll cnt = 0;
    for (ll i = 0; i < R.size(); i++)
    {

         cnt++;
        // cout << R[i].first<<"    "<<R[i].second<<" "<<cnt<<endl;
        F[-R[i].second] = cnt;

    }
   // for (ll i =0 ; i < n; i++)
   // cout <<F[i]<<" ";
    cout << mergeSort(F,n) << endl;
    return 0;
}