n, d = map(int, input().split())
lst = [[int(j) for j in input().split()] for i in range(n)]
count = 0
for x in lst:
  distance = (x[0]**2 + x[1]**2)**0.5
  if distance <= d:
    count += 1
print(count) n, d = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split d [int(j) for j in input().split()] for i in range(n) for i in range(n) i range(n) range n for i in range(n) [int(j) for j in input().split()] lst = [[int(j) for j in input().split()] for i in range(n)] lst [[int(j) for j in input().split()] for i in range(n)] count = 0 count 0 for x in lst:
  distance = (x[0]**2 + x[1]**2)**0.5
  if distance <= d:
    count += 1 x lst distance = (x[0]**2 + x[1]**2)**0.5 distance (x[0]**2 + x[1]**2)**0.5 x[0]**2 + x[1]**2 x[0]**2 x[0] x 0 2 x[1]**2 x[1] x 1 2 0.5 if distance <= d:
    count += 1 distance <= d distance d count += 1 count 1 print(count) print count distance = (x[0]**2 + x[1]**2)**0.5 (x[0]**2 + x[1]**2)**0.5 distance n, d = map(int, input().split()) map(int, input().split()) n count += 1 1 count lst = [[int(j) for j in input().split()] for i in range(n)] [[int(j) for j in input().split()] for i in range(n)] lst d = map(int, input().split()) map(int, input().split()) d count = 0 0 count
n, d = map(int, input().split())
lst = [[int(j) for j in input().split()] for i in range(n)]
count = 0
for x in lst:
  distance = (x[0]**2 + x[1]**2)**0.5
  if distance <= d:
    count += 1
print(count)
