#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<queue>
using namespace std;
struct cow{
	int qs;
	int speed;
}E[1000000];
int n,t,m;
long long sum=0;

bool cmp(const cow&a,const cow &b){
	return a.qs<b.qs;
}

int main()
{
	freopen("cowjoga.in","r",stdin);
	freopen("cowjoga.out","w",stdout);
	cin>>m>>t;
	for (int i=1;i<=m;++i)
	 scanf("%d%d",&E[i].qs,&E[i].speed);
	sort(E+1,E+m+1,cmp);
	for (int i=1;i<=m;++i)
	 if (E[i].speed>E[i-1].speed||(E[i].speed==E[i-1].speed&&E[i].qs>E[i-1].qs)||(E[i].speed<E[i-1].speed&&(E[i-1].speed-E[i].speed)*t<E[i].qs-E[i-1].qs))
	  sum++;
	cout<<sum<<" ";
	return 0;
}