#include //#include using namespace std; //using namespace atcoder; using ll = long long; const ll mod = 1000000007; //const ll mod = 998244353; int dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 }; ll n,k, h[2009], x[2009], y[2009]; vector < tuple >T; int main() { cin >> n >> k; for (int i = 1; i <= n; i++)cin >> h[i]; for (int i = 1; i <= n; i++) { cin >> x[i] >> y[i]; T.emplace_back(h[i], x[i], y[i]); } sort(T.begin(), T.end()); ll ans = n; for (int i = 0; i < n; i++) { bool ok = false; for (int j = i + 1; j < n; j++) { if (get<0>(T[i]) >=get<0>(T[j]))continue; ll len = (get<1>(T[j]) - get<1>(T[i])) * (get<1>(T[j]) - get<1>(T[i])) + (get<2>(T[j]) - get<2>(T[i])) * (get<2>(T[j]) - get<2>(T[i])); if (len <= k * k)ok = true; } if (ok)ans--; } cout << ans << endl; }