#include<fstream>
#include<cmath>
#include<algorithm>
#define MAXN 100001
#define INF 0x7fffffff
#define LL long long
using namespace std;
ifstream fin("cowjogb.in");
ofstream fout("cowjogb.out");
int N,K=0;
LL T,F[MAXN],A[MAXN];
int find(int x)
{
	int l=0,r=K;
	while(l!=r)
	{
		int m=(l+r)>>1;
		if(F[m]==x) return m;
		if(F[m+1]>=x) l=m+1;
		else r=m;
	}
	return l;
}
int main()
{
	fin>>N>>T;
	LL s,v;
	for(int i=1;i<=N;i++)
	{
		fin>>s>>v;
		A[i]=s+v*T;
	}
	F[0]=INF;
	for(int i=1;i<=N;i++)
	{
	    if(A[i]<=F[K]) F[++K]=A[i];
		else
		{
			int pos=find(A[i]);
			if(F[pos+1]<=A[i]) F[pos+1]=A[i];
		}
	}
	fout<<K<<endl;
	return 0;
}