#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++ )
using ll = long long;

int main() {
	int N;
	ll K;
	cin >> N >> K;
	K = K * K;
	vector<int> h(N), x(N), y(N), d(N);
	rep(i, N) cin >> h[i];
	rep(i, N) cin >> x[i] >> y[i];
	using T = tuple<int, int, int, int>;
	vector<T> t(N);
	rep(i, N) t[i] = T(h[i], x[i], y[i], i);
	sort(t.begin(), t.end());
	rep(i, N) {
		ll hh, xx, yy, ii;
		tie(hh, xx, yy, ii) = t[i];
		for(int j = i + 1; j < N; j++) {
			ll h1, x1, y1, j1;
			tie(h1, x1, y1, j1) = t[j];
			if(hh == h1) continue;
			ll dx = xx - x1;
			ll dy = yy - y1;
			if(dx * dx + dy * dy <= K) {
				d[ii] = 1;
				break;
			}
		}
	}
	int ans = 0;
	rep(i, N) if(d[i] == 0) ans++;
	cout << ans << endl;
}