#include <iostream>
#include <cmath>
using namespace std;

typedef long long ll;

int main() {
    ll N,K;
    cin >> N >> K;
    ll H[N];
    for (ll i = 0; i < N; i++) {
        cin >> H[i];
    }

    ll X[N],Y[N];
    for (ll i = 0; i < N; i++) {
        cin >> X[i] >> Y[i];
    }

    ll ans = N;
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < N; j++) {
            if (sqrt(pow(X[i]-X[j],2)+pow(Y[i]-Y[j],2)) <= K) {
                if (H[i] < H[j]) {
                    ans--;
                    break;
                }
            }
        }
    }

    cout << ans << endl;
    return 0;
}