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

int main() {
    int N;
    long long K;
    cin >> N >> K;
    vector<long long> H(N);
    for (int i = 0; i < N; i++) {
        cin >> H[i];
    }
    vector<long long> X(N), Y(N);
    for (int i = 0; i < N; i++) {
        cin >> X[i] >> Y[i];
    }
    vector<pair<long long, int>> h(N);
    for (int i = 0; i < N; i++) {
        h[i] = {H[i], i};
    }
    sort(h.begin(), h.end());
    int ans = N;
    for (int i = 0; i < N; i++) {
        auto [h1, i1] = h[i];
        for (int j = i + 1; j < N; j++) {
            auto [h2, i2] = h[j];
            if (h1 == h2) continue;
            long long dx = X[i1] - X[i2];
            long long dy = Y[i1] - Y[i2];
            if (dx * dx + dy * dy <= K * K) {
                ans--;
                break;
            }
        }
        // cout << i << " " << ans << endl;
    }
    cout << ans << endl;
    return 0;
}