N, D = map(int, input().split())
zahyo = [list(map(int, input().split())) for i in range(N)]

def distance(a, b):
    return (a ** 2 + b ** 2) ** 0.5

kazu = 0
for i in range(N):
    genzai = zahyo[i]
    if distance(genzai[0], genzai[1]) <= D:
        kazu += 1

print(kazu) 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 zahyo = [list(map(int, input().split())) for i in range(N)] zahyo [list(map(int, input().split())) for i in range(N)] def distance(a, b):
    return (a ** 2 + b ** 2) ** 0.5 distance return (a ** 2 + b ** 2) ** 0.5 (a ** 2 + b ** 2) ** 0.5 a ** 2 + b ** 2 a ** 2 a 2 b ** 2 b 2 0.5 a a b b kazu = 0 kazu 0 for i in range(N):
    genzai = zahyo[i]
    if distance(genzai[0], genzai[1]) <= D:
        kazu += 1 i range(N) range N genzai = zahyo[i] genzai zahyo[i] zahyo i if distance(genzai[0], genzai[1]) <= D:
        kazu += 1 distance(genzai[0], genzai[1]) <= D distance(genzai[0], genzai[1]) distance genzai[0] genzai 0 genzai[1] genzai 1 D kazu += 1 kazu 1 print(kazu) print kazu N, D = map(int, input().split()) map(int, input().split()) N genzai = zahyo[i] zahyo[i] genzai D = map(int, input().split()) map(int, input().split()) D zahyo = [list(map(int, input().split())) for i in range(N)] [list(map(int, input().split())) for i in range(N)] zahyo def distance(a, b):
    return (a ** 2 + b ** 2) ** 0.5 def distance(a, b):
    return (a ** 2 + b ** 2) ** 0.5 distance kazu = 0 0 kazu kazu += 1 1 kazu
N, D = map(int, input().split())
zahyo = [list(map(int, input().split())) for i in range(N)]

def distance(a, b):
    return (a ** 2 + b ** 2) ** 0.5

kazu = 0
for i in range(N):
    genzai = zahyo[i]
    if distance(genzai[0], genzai[1]) <= D:
        kazu += 1

print(kazu)