import heapq 
from heapq import heappop,heappush,heapify
from sys import stdin, setrecursionlimit
input = stdin.readline
readline = stdin.readline

from collections import deque
d=deque()

#T=int(input())
N,K=map(int,input().split())
H=list(map(int, input().split()))
A=[]
C=[[0]*N for i in range(N)]
for i in range(N):
  x,y=map(int,input().split())
  A.append((x,y))
  
D=[]
for i in range(N):
  for j in range(N):
    x,y=A[i];p,q=A[j]
    if H[i]<H[j] and (x-p)**2+(y-q)**2<=K**2:
      D.append((H[j],j,i))
D=sorted(D)
ans=[1]*N 
for _,_,x in D:
  ans[x]=0 
print(sum(ans))