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))
  
ans=[1]*N 
for i in range(N-1):
  for j in range(i+1,N):
    x,y=A[i];p,q=A[j]
    if (x-p)**2+(y-q)**2<=K**2:
      if H[i]<H[j]:
        ans[i]=0
      elif H[i]>H[j]:
        ans[j]=0
print(sum(ans))