#include<stdio.h>
#include<cstring>
const int maxn=1000011;
const long long INF=1e18;
long long pos[maxn];
int v[maxn]; 
int n,t;
int main()
{
	freopen("cowjoga.in","r",stdin);
	freopen("cowjoga.out","w",stdout);
	scanf("%d%d",&n,&t);
	for(int i=1;i<=n;i++)
	 scanf("%d%d",&pos[i],&v[i]);
	pos[n+1]=INF;
	v[n+1]=v[n]; 
	for(int i=1;i<=t;i++)
	{
		for(int j=n;j>=1;j--)
		{
			pos[j]+=v[j];
			if(pos[j+1]<=pos[j]) 
			{
				pos[j]=pos[j+1];
				v[j]=v[j+1];
			}
		}
	}
	int ans=0;
	for(int i=1;i<=n;i++)
	 if(pos[i]!=pos[i+1])
	 {
	 	ans++;
	 }
	printf("%d",ans);
}