#include <iostream>
#include <cmath>
#include <stack>
#include <iomanip>
#include <limits>
#include <queue>
#include <map>
#include <set>
#include<algorithm>
#include<deque>
using namespace std;
#define rep(i, n) for (int i = 0;i < (n); ++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<long long> 
#define vvl vector<vector<long long>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>> 
using ll = long long;
using P = pair<ll,ll>;
void chmin(ll &a,ll b){
    a = min(a,b);
}
void chmax(int &a,int b){
    a = max(a,b);
} 

const ll INF = 2e18;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;ll k;
    cin >> n >> k;
    k = k*k;
    vector<ll> sh(n);
    vector<P> p(n);
    rep(i,n){
      cin >> sh[i];
      p[i] = make_pair(sh[i],i);
    }
    sort(p.begin(),p.end());
    vl h(n);
    rep(i,n){
        h[p[i].second] = p[i].first;
    }
    vector<ll> sx(n),sy(n),x(n),y(n);
    rep(i,n) cin >> sx[i] >> sy[i];
    for(int i = 0;i < n;i++){
        x[i] = sx[p[i].second];
        y[i] = sy[p[i].second];
    }
    vector<bool> ex(n,false);
    for(int i = 0;i < n;i++){
        for(int j = i+1;j < n;j++){
            if(ex[i] || ex[j])continue;
            if(h[i] == h[j])continue;
            if(abs(x[i]-x[j])*abs(x[i]-x[j])+abs(y[i]-y[j])*abs(y[i]-y[j]) > k){
               continue;
            }
            ex[i] = true;
        }

    }
    ll ans = 0;
    for(int i = 0;i < n;i++){
        if(!ex[i])ans++;
    }
    cout << ans << endl;
    return 0;


}