#include<cstdio>
#include<iostream>
#include<cstring>
#include<ctime>
#include<limits.h>
#include<algorithm>
using namespace std;

typedef long long LL;

const int maxn=100050;
const LL INF=9000000000000000000;

int buf[40];
bool vis[maxn];
LL n,T,v[maxn],p[maxn],pos[maxn];

template<class T> inline bool getd(T& x)
{
	int ch=getchar();
	bool neg=false;
	while(ch!=EOF && ch!='-' && !isdigit(ch)) ch=getchar();
	if(ch==EOF) return false;
	if(ch=='-'){
		neg=true;
		ch=getchar();
	}
	x=ch-'0';
	while(isdigit(ch=getchar())) x=x*10+ch-'0';
	if(neg) x=-x;
	return true;
}

template<class M> inline void putd(M x)
{
	int p=0;
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x==0) buf[p++]=0;
	while(x){
		buf[p++]=x%10;
		x/=10;
	}
	for(int i=p-1;i>=0;i--) putchar(buf[i]+'0');
	putchar('\n');
}

LL getfather(LL x){ return p[x]==x?x:p[x]=getfather(p[x]); }

void init()
{
	getd(n);getd(T);
	for(int i=0;i<n;i++){
		getd(pos[i]);
		getd(v[i]);
	}
	pos[n]=INF;
	for(int i=0;i<n;i++) p[i]=i;
}

void work()
{
	LL ans=0;
	for(int i=n-1;i>=0;i--){
		pos[i]=pos[i]+T*v[i];
		if(pos[i]>=pos[i+1]){
			LL x=getfather(i),y=getfather(i+1);
			p[x]=y;
			pos[i]=pos[i+1];
		}
	}
	
	memset(vis,false,sizeof(vis));
	for(int i=0;i<n;i++){
		LL x=getfather(i);
		if(!vis[x]){
			vis[x]=true;
			ans++;
		}
	}
	putd(ans);
}

int main()
{
	freopen("cowjoga.in","r",stdin);
	freopen("cowjoga.out","w",stdout);
	init();
	work();
	fclose(stdin);
	fclose(stdout);
	return 0;
}