#include<bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353;
using namespace std;
using ll=long long;
using ul=unsigned long long;
int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
using Graph=vector<vector<int>>;
int main(){
    int N;ll K;
    cin>>N>>K;
    vector<ll>H(N),X(N),Y(N);
    vector<bool>S(N);
    for(int i=0;i<N;i++)cin>>H[i];
    for(int i=0;i<N;i++)cin>>X[i]>>Y[i];
    for(int i=0;i<N;i++){
        if(S[i])continue;
        for(int j=0;j<N;j++){
            ll di=X[i]-X[j],dj=Y[i]-Y[j];
            if(di*di+dj*dj<=K*K){
                if(H[i]<H[j]){
                    S[i]=true;
                    break;
                }
                else if(H[j]<H[i]){
                    S[j]=true;
                }
            }
        }
    }
    cout<<count(S.begin(),S.end(),false)<<endl;
}