#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("cowjoga.in");
ofstream out("cowjoga.out");
int N,T;
int SP[100001]={0};
class node
{
public:
	int v;
	int s;
}f[100001];
bool com(node a,node b)
{
	if(a.s<b.s)return 1;
	if(a.s==b.s)
	{
		if(a.v<b.v)return 1;
	}
	return 0;
}
int main()
{
	int i,ans=1,e;
	in>>N>>T;
	for(i=1;i<=N;i++)in>>f[i].s>>f[i].v;
	sort(f+1,f+N+1,com);
	for(i=1;i<=N;i++)SP[i]=f[i].s+f[i].v*T;
	e=SP[N];
	for(i=N;i>=1;i--)
	{
		if(SP[i]<e)
		{
			ans++;
			e=SP[i];
		}
	}
	out<<ans<<endl;
	return 0;
}