using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        var h = NList;
        var map = NArr(n);
        var order = new List<int>();
        for (var i = 0; i < n; ++i) order.Add(i);
        order.Sort((l, r) => h[l].CompareTo(h[r]));
        var ans = n;
        var k2 = (long)k * k;
        for (var i = 0; i < n; ++i) for (var j = i + 1; j < n; ++j)
        {
            if (h[order[i]] < h[order[j]] && Len(map[order[i]], map[order[j]]) <= k2)
            {
                --ans;
                break;
            }
        }
        WriteLine(ans);
    }
    static long Len(int[] a, int[] b)
    {
        return (long)(a[0] - b[0]) * (a[0] - b[0]) + (long)(a[1] - b[1]) * (a[1] - b[1]);
    }
}