#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  int n, d;
  cin >> n >> d;
  pair<ll, ll> pos[n];
  for (int i = 0; i < n; i++) cin >> pos[i].first >> pos[i].second;
  ll x, y;
  int count = 0;
  for (int i = 0; i < n; i++) {
    x = pos[i].first;
    y = pos[i].second;
    if (sqrt(x * x + y * y) <= d) count++;
  }
  cout << count << endl;
}
