#include<iostream>
#include<cstdio>
using namespace std;
int n;
long long t,ans=0;
class cow
{
public:
	long long place,v;
	int p,rank;
	cow(){
		place=0;v=0;p=0;rank=0;
	}
}a[100005];
//*********************************不要浮躁*****************************************//
void init()
{
	cin>>n>>t;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].place>>a[i].v;
		a[i].p=i;
	}
}
int find(int x)
{
	if(x!=a[x].p)
		return a[x].p=find(a[x].p);
	return a[x].p;
}
void link(int x,int y)
{
	a[x].p=y;
}
void a_union(int x,int y)
{
	link(find(x),find(y));
}
void work()
{
	for(int i=n;i>1;i--)
	{
		long long temp1=a[i-1].place+a[i-1].v*t;
		long long temp2=a[i].place+a[i].v*t;
		if(temp1>=temp2)
		{
			a_union(i,i+1);
			a[i-1].v=a[i].v;
		}
	}
}
void print()
{
	bool b[100005]={0};
	for(int i=1;i<=n;i++)
	{
		int temp=find(i);
		if(!b[temp])
		{
			b[temp]=1;
			ans++;
		}
	}
	cout<<ans;
}
int main()
{
	freopen("cowjoga.in","r",stdin);
	freopen("cowjoga.out","w",stdout);
	init();
	work();
	print();
	return 0;
}