#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iomanip>
#include<cstdlib>
using namespace std;
typedef long long LL;
const int SIZEN=100010;
int N;
LL pos[SIZEN],vel[SIZEN];
LL end[SIZEN];
LL T;
void work(void){
	LL now=end[N];
	int ans=1;
	for(int i=N-1;i>=1;i--){
		if(end[i]<now){
			ans++;
			now=end[i];
		}
	}
	cout<<ans<<endl;
}
void read(void){
	cin>>N>>T;
	for(int i=1;i<=N;i++){
		scanf("%lld%lld",&pos[i],&vel[i]);
		end[i]=pos[i]+vel[i]*T;
	}
}
int main(){
	freopen("cowjoga.in","r",stdin);
	freopen("cowjoga.out","w",stdout);
	read();
	work();
	return 0;
}