#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r+1)
#define all(x) (x).begin(),(x).end()
#define inf 1000000000
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int> >;
struct jinja {
    int h; ll x; ll y;
};

int main() {
    // 高速化
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    // 小数点の出力桁数を指定
    cout << fixed << setprecision(10);

    // メイン
    int N, K;
    cin >> N >> K;
    vector<jinja> J(N);
    rep(i, 0, N) cin >> J[i].h;
    rep(i, 0, N) cin >> J[i].x >> J[i].y;
    //sort(all(J), [](auto const& lhs, auto const& rhs) {
    //    return lhs.h <= rhs.h;
    //});
    //rep(i,0,N) cout << J[i].h << " ";
    //cout << endl;
    int ans = N;
    rep(i, 0, N) {
        rep(j, 0, N) {
            ll xdiff = J[i].x - J[j].x, ydiff = J[i].y - J[j].y;
            if(xdiff*xdiff + ydiff*ydiff <= K*K && J[i].h < J[j].h) {
                ans--;
                break;
            }
        }
    }
    cout << ans << endl;

    return 0;
}