from collections import defaultdict


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

n, k = map(int, input().split())
h = list(map(int, input().split()))
uf = UnionFind(n)

def distance2(A, B):
    x1, y1 = A
    x2, y2 = B
    return (x2-x1)**2 + (y2-y1)**2

p = []
for _ in range(n):
    x, y = map(int, input().split())
    p.append((x, y))

search = list(enumerate(h))
search.sort(key = lambda x: x[1])
use = [0] * n
# print(search)
for i, val in search:
    if use[i]: continue
    for j in range(n):
        if use[j]: continue
        if h[j] >= h[i]: continue
        if distance2(p[i], p[j]) > k*k: continue
        uf.union(i, j)
        use[j] = 1

print(uf.group_count())