#include<cstdio>
using namespace std;
typedef long long LL;
const int N = 100100;
int n,ans;
LL t,a[N],b[N],last;
int main(){
	#define READ
	#ifdef READ
	    freopen("cowjoga.in","r",stdin);
	    freopen("cowjoga.out","w",stdout);
	#endif
	scanf("%d%lld",&n,&t);
	for(int i=1;i<=n;i++) scanf("%lld%lld",&a[i],&b[i]),b[i]=a[i]+b[i]*t;
	ans=1;last=b[n];
	for(int i=n-1;i>=1;i--) if(last>b[i]) ans++,last=b[i];
	printf("%d\n",ans);
	//while(1);
	return 0;
}