#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	long long k; cin >> k;
	vector<int>h(n);
	rep(i, n)cin >> h[i];
	vector<long long>x(n), y(n);
	rep(i, n)cin >> x[i] >> y[i];
	auto dist = [&](int i, int j)->bool {
		long long dx = x[i] - x[j];
		long long dy = y[i] - y[j];
		long long d = dx * dx + dy * dy;
		return d <= k * k;
	};
	int ans = 0;
	rep(i, n) {
		int cnt = 0;
		rep(j, n) {
			if (h[i] >= h[j])continue;
			cnt += dist(i, j);
		}
		if (cnt)ans++;
	}
	cout << n - ans << endl;
	return 0;
}