import sys
import math
from itertools import product, permutations, combinations, accumulate
from heapq import heapify, heappush, heappop
from collections import deque, defaultdict, Counter
from bisect import bisect, bisect_left, bisect_right
from copy import copy, deepcopy
#from sortedcontainers import SortedSet, SortedList, SortedDict

sys.setrecursionlimit(10**7)
INF = float('inf')
LINF = 1 << 60
MOD = 10**9+7

def mii():
    return map(int, sys.stdin.readline().split())

N, K = mii()

H = list(mii())
XY = []
for i in range(N):
    XY.append(list(mii()))

graph = [[] for _ in range(N)]

def near(p1, p2):
    dist = (p1[0] - p2[0])**2 + (p1[1] - p2[1]) ** 2
    return dist <= K**2

indices = [0] * N

for i in range(N):
    for j in range(i+1, N):
        if H[i] < H[j] and near(XY[i], XY[j]):
            graph[i].append(j)
            indices[j] += 1
        elif H[i] > H[j] and near(XY[i], XY[j]):
            graph[j].append(i)
            indices[i] += 1


que = deque()
for i in range(N):
    if indices[i] == 0:
        que.append(i)

cnt = N

while len(que):
    u = que.pop()
    
    if len(graph[u]) >= 1:
        cnt -= 1
        for v in graph[u]:
            indices[v] -= 1
            if indices[v] == 0:
                que.append(v)

print(cnt)