#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,K;
int H[2020];
map<int,vector<int>> M;
ll X[2020],Y[2020];
int del[2020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	FOR(i,N) {
		cin>>H[i];
		M[H[i]].push_back(i);
	}
	FOR(i,N) cin>>X[i]>>Y[i];
	
	int lef=N;
	FORR2(a,b,M) {
		FORR(v,b) {
			FOR(i,N) if(H[i]<H[v]&&del[i]==0&&(X[i]-X[v])*(X[i]-X[v])+(Y[i]-Y[v])*(Y[i]-Y[v])<=1LL*K*K) {
				del[i]=1;
				lef--;
			}
		}
	}
	cout<<lef<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}