#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, t;
struct node {
	int x, y;
	long double dis;
} b[500005];
bool cmp(node p, node q) {
	return p.dis < q.dis;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> t;
	for (int i = 1; i <= n; i++) {
		cin >> b[i].x >> b[i].y;
		b[i].dis = sqrt((10000000 - b[i].x) * (10000000 - b[i].x) + b[i].y * b[i].y);
	}
	sort(b + 1, b + n + 1, cmp);
	long long ans = 0;
	for (int i = 1; i <= n; i++) {
		if (b[i].dis <= ans * t + 10000000) {
			ans++;
		} else {
			break;
		}
	}
	cout << ans;
}