#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
ifstream fin("include.in");
ofstream fout("include.out");
vector<long long> TT;
int main(){
	int n,T;
	fin>>n>>T;
	TT.resize(n);
	int j=0;
	for(int i=0;i!=n;++i,++j){
		int beg,v;
		fin>>beg>>v;
		//cout<<beg<<"  "<<v<<endl;
		TT[j]=(beg+T*v);
	}
	long long ans=1,r=TT[TT.size()-1];
	for(int i=TT.size()-1;i>=0;--i){
		if(TT[i]<r){
			r=TT[i];
			++ans;
		}
	}
	fout<<ans<<endl;
	return 0;
}
//designed by wolf