#include<iostream>
#include<cstdio>
using namespace std;
class cow
{
public:
	int p;
	long long rank;
	long long place;
	long long v;
	cow(){
		p=0;rank=0;place=0;v=0;
	}
}a[100005];
int n,t;
//*************************************不要浮躁***************************************//
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 init()
{
	cin>>n>>t;
	for(int i=1;i<=n;i++)
	{
		a[i].p=i;
		cin>>a[i].place>>a[i].v;
		a[i].rank=a[i].place+a[i].v*t;
	}
	
}
void work()
{
	int count[100005]={0};
	int Max=0;
	for(int i=n;i>1;i--)
	{
		if(a[i-1].rank>=a[i].rank) 
			a_union(i-1,i);
	}
	for(int i=1;i<=n;i++) count[find(i)]++;
	for(int i=1;i<=n;i++) if(count[i]>Max) Max=count[i];
	cout<<Max;
}
int main()
{
	freopen("cowjogb.in","r",stdin);
	freopen("cowjogb.out","w",stdout);
	init();
	work();
	return 0;
}