import math
n, d = map(int, input().split())
count = 0
for i in range(0,n):
    x, y = map(int, input().split())
    square = x * x + y * y
    distance = math.sqrt(square)
    if distance <= d:
        count += 1
print(count) import math math n, d = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split d count = 0 count 0 for i in range(0,n):
    x, y = map(int, input().split())
    square = x * x + y * y
    distance = math.sqrt(square)
    if distance <= d:
        count += 1 i range(0,n) range 0 n x, y = map(int, input().split()) x map(int, input().split()) map int input().split() ().split () input split y square = x * x + y * y square x * x + y * y x * x x x y * y y y distance = math.sqrt(square) distance math.sqrt(square) math.sqrt math sqrt square if distance <= d:
        count += 1 distance <= d distance d count += 1 count 1 print(count) print count distance = math.sqrt(square) math.sqrt(square) distance count += 1 1 count square = x * x + y * y x * x + y * y square d = map(int, input().split()) map(int, input().split()) d y = map(int, input().split()) map(int, input().split()) y n, d = map(int, input().split()) map(int, input().split()) n count = 0 0 count x, y = map(int, input().split()) map(int, input().split()) x
import math
n, d = map(int, input().split())
count = 0
for i in range(0,n):
    x, y = map(int, input().split())
    square = x * x + y * y
    distance = math.sqrt(square)
    if distance <= d:
        count += 1
print(count)