#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int n, K;
int h[2000];
int x[2000], y[2000];
int inV[2000];

signed main() {
    int i, j;

    cin >> n >> K;
    rep(i, n) cin >> h[i];
    rep(i, n) cin >> x[i] >> y[i];
    rep(i, n) {
        for (j = i + 1; j < n; j++) {
            int dx = x[j] - x[i];
            int dy = y[j] - y[i];
            if (dx * dx + dy * dy <= K * K) {
                if (h[i] > h[j]) {
                    inV[j]++;
                }
                else if (h[i] < h[j]) inV[i]++;
            }
        }
    }

    int ans = 0;
    rep(i, n) if (inV[i] == 0) ans++;

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