#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll N, K, X, Y, ans=0, X2, Y2, H1, H2;
    cin >> N >> K;
    vector<ll> H(N);
    vector<tuple<ll, ll, ll>> v(N);
    vector<bool> ok(N, 1);
    for (int i=0; i<N; i++) cin >> H[i];
    for (int i=0; i<N; i++){
        cin >> X >> Y;
        v[i] = {H[i], X, Y};
    }
    sort(v.begin(), v.end());
    for (int i=0; i<N; i++){
        tie(H1, X, Y) = v[i];
        for (int j=0; j<i; j++){
            tie(H2, X2, Y2) = v[j];
            if (H1 == H2) continue;
            if ((X-X2)*(X-X2)+(Y-Y2)*(Y-Y2)<=K*K) ok[j] = 0;
        }
    }

    for (int i=0; i<N; i++) ans += ok[i];

    cout << ans << endl;

    return 0;
}