#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

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

    ll n,k;
    cin>>n>>k;
    vector<ll> h(n);
    for(int i = 0;i<n;i++) cin>>h[i];
    ll ans = 0;
    vector<ll> x(n),y(n);
    for(int i = 0;i<n;i++) cin>>x[i]>>y[i];
    vector<int> vis(n,0);
    for(int i = 0;i<n;i++) if(vis[i]==0) {
        vector<int> que;
        int cnt = 0;
        que.push_back(i);
        vis[i]++;
        for(int j = 0;j<que.size();j++){
            int ni = que[j];
            bool fn = false;
            for(int l = 0;l<n;l++) {
                //if(vis[l]) continue;
                if(h[l]==h[ni]) continue;
                ll dx = x[l] - x[ni];
                ll dy = y[l] - y[ni];
                if(dx*dx+dy*dy<=k*k){
                    if(h[ni]<h[l]) fn = true;
                    if(vis[l]==0){
                        que.push_back(l);
                        vis[l]++;
                    }
                }
            }
            if(!fn) cnt++;
        }
        if(cnt==0) cnt++;

        ans += cnt;
    }
    cout<<ans<<endl;
}