N, D = map(int, input().split())
i = 0
count = 0
while (i < N):
    p, q = map(int, input().split())
    d = (p*p + q*q) ** 0.5
    if (d <= D):
        count+= 1
    i+= 1
print(count) N, D = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split D i = 0 i 0 count = 0 count 0 while (i < N):
    p, q = map(int, input().split())
    d = (p*p + q*q) ** 0.5
    if (d <= D):
        count+= 1
    i+= 1 i < N i N p, q = map(int, input().split()) p map(int, input().split()) map int input().split() ().split () input split q d = (p*p + q*q) ** 0.5 d (p*p + q*q) ** 0.5 p*p + q*q p*p p p q*q q q 0.5 if (d <= D):
        count+= 1
     d <= D d D count+= 1 count 1 i+= 1 i 1 print(count) print count count = 0 0 count i = 0 0 i q = map(int, input().split()) map(int, input().split()) q i+= 1 1 i N, D = map(int, input().split()) map(int, input().split()) N d = (p*p + q*q) ** 0.5 (p*p + q*q) ** 0.5 d D = map(int, input().split()) map(int, input().split()) D p, q = map(int, input().split()) map(int, input().split()) p count+= 1 1 count
N, D = map(int, input().split())
i = 0
count = 0
while (i < N):
    p, q = map(int, input().split())
    d = (p*p + q*q) ** 0.5
    if (d <= D):
        count+= 1
    i+= 1
print(count)