from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations
from functools import cmp_to_key, cache
from heapq import heappop, heappush
import math, sys
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10**7)
_int = lambda x: int(x)-1
MOD = 998244353
INF = 1<<62
Yes, No = "Yes", "No"

N, K = map(int, input().split())
H = list(map(int, input().split()))

XY = []
for i in range(N):
    x, y = map(int, input().split())
    XY.append((x, y))

def ok(i, j):
    xi, yi = XY[i]
    xj, yj = XY[j]
    dist = (xi-xj)**2 + (yi-yj)**2
    return dist <= K*K

E = defaultdict(list)
for i in range(N):
    for j in range(i+1, N):
        if ok(i, j):
            if H[i] > H[j]:
                E[i].append(j)
            elif H[i] < H[j]:
                E[j].append(i)

Q = [(H[i], i) for i in range(N)]
Q.sort(reverse=True)
memo = [-1]*N
for h, start in Q:
    if memo[start] != -1: continue
    memo[start] = 1
    q = deque([start])
    while q:
        i = q.popleft()
        for j in E[i]:
            if memo[j] != -1: continue
            memo[j] = 0
            q.append(j)
print(sum(memo))