#include<iostream>
#include<fstream>
#include<string>
#include<vector>
#include<cmath>
#include<cstdio>
#include<algorithm>
#define MAXN 100000
using namespace std;
long long L[MAXN], R[MAXN], V[MAXN],  ans;
bool O[MAXN]={false};
int n, t;

void moveon(int x, int y, int f, int p)
{
	if(O[p])return;
	while(f<=n && (x>R[f]||y<L[f]))f++;
	if(f>n)
	{
		ans--;
		O[p]=true;
		return;
	}
	if(x<L[f] && y<L[f])moveon(x, L[f], f+1, p);
	if(y<R[f] && x<R[f])moveon(R[f], y, f+1, p);
}

int main()
{
	ios::sync_with_stdio(false);
	freopen("cowjogb.in","r",stdin);
	freopen("cowjogb.out","w",stdout);
	int i;
	cin>>n>>t;
	ans=n;
	for(i=1;i<=n;i++)
	{
		cin>>L[i]>>V[i];
		R[i]=L[i]+V[i]*t;
	}
	/*for(i=1;i<=n;i++)
	{
		cout<<L[i]<<' '<<R[i]<<endl;
	}*/
	for(i=2;i<=n;i++)
	{
		moveon(L[i], R[i], i+1, i);
	}
	cout<<ans<<endl;
	return 0;
}