n,d = map(int,input().split())

p = [list(map(int,input().split())) for i in range(n)]

kyori = d * d
count = 0

for s in range(n):
  nagasa = p[s][0] * p[s][0] + p[s][1] * p[s][1]
  if nagasa <= kyori:
    count += 1
    
print(count) n,d = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split d list(map(int,input().split())) for i in range(n) for i in range(n) i range(n) range n for i in range(n) list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split p = [list(map(int,input().split())) for i in range(n)] p [list(map(int,input().split())) for i in range(n)] kyori = d * d kyori d * d d d count = 0 count 0 for s in range(n):
  nagasa = p[s][0] * p[s][0] + p[s][1] * p[s][1]
  if nagasa <= kyori:
    count += 1
     s range(n) range n nagasa = p[s][0] * p[s][0] + p[s][1] * p[s][1] nagasa p[s][0] * p[s][0] + p[s][1] * p[s][1] p[s][0] * p[s][0] p[s][0] [s] p s 0 p[s][0] [s] p s 0 p[s][1] * p[s][1] p[s][1] [s] p s 1 p[s][1] [s] p s 1 if nagasa <= kyori:
    count += 1
     nagasa <= kyori nagasa kyori count += 1 count 1 print(count) print count nagasa = p[s][0] * p[s][0] + p[s][1] * p[s][1] p[s][0] * p[s][0] + p[s][1] * p[s][1] nagasa d = map(int,input().split()) map(int,input().split()) d n,d = map(int,input().split()) map(int,input().split()) n p = [list(map(int,input().split())) for i in range(n)] [list(map(int,input().split())) for i in range(n)] p kyori = d * d d * d kyori count += 1 1 count count = 0 0 count
n,d = map(int,input().split())

p = [list(map(int,input().split())) for i in range(n)]

kyori = d * d
count = 0

for s in range(n):
  nagasa = p[s][0] * p[s][0] + p[s][1] * p[s][1]
  if nagasa <= kyori:
    count += 1
    
print(count)
