#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll D=10000000;
ll x[500005],y[500005];
ll dis[500005];
int main(){
	int n,t;
	scanf("%d%d",&n,&t);
	for(int i=1;i<=n;i++)scanf("%lld%lld",&x[i],&y[i]);
	for(int i=1;i<=n;i++)dis[i]=(x[i]-D)*(x[i]-D)+y[i]*y[i];
	sort(dis+1,dis+n+1);
//	for(int i=1;i<=n;i++)printf("%lld ",dis[i]);printf("\n");
	int pos=0;
	while(pos<n && dis[pos+1]<=D*D){
		pos++;
		D+=t;
	}
	printf("%d",pos);
	return 0;
}