import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


N, D = MI()

ans = 0
for _ in range(N):
    X, Y = MI()
    if X ** 2 + Y ** 2 <= D ** 2:
        ans += 1
print(ans) import sys sys sys.setrecursionlimit(300000) sys.setrecursionlimit sys setrecursionlimit 300000 def I(): return int(sys.stdin.readline()) I def MI(): return map(int, sys.stdin.readline().split()) MI def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split()) MI0 def LMI(): return list(map(int, sys.stdin.readline().split())) LMI def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split())) LMI0 MOD = 10 ** 9 + 7 MOD 10 ** 9 + 7 10 ** 9 10 9 7 INF = float('inf') INF float('inf') float 'inf' N, D = MI() N MI() MI D ans = 0 ans 0 for _ in range(N):
    X, Y = MI()
    if X ** 2 + Y ** 2 <= D ** 2:
        ans += 1 _ range(N) range N X, Y = MI() X MI() MI Y if X ** 2 + Y ** 2 <= D ** 2:
        ans += 1 X ** 2 + Y ** 2 <= D ** 2 X ** 2 + Y ** 2 X ** 2 X 2 Y ** 2 Y 2 D ** 2 D 2 ans += 1 ans 1 print(ans) print ans def LMI(): return list(map(int, sys.stdin.readline().split())) def LMI(): return list(map(int, sys.stdin.readline().split())) LMI ans = 0 0 ans def MI(): return map(int, sys.stdin.readline().split()) def MI(): return map(int, sys.stdin.readline().split()) MI def I(): return int(sys.stdin.readline()) def I(): return int(sys.stdin.readline()) I N, D = MI() MI() N X, Y = MI() MI() X D = MI() MI() D MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD ans += 1 1 ans Y = MI() MI() Y def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split())) def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split())) LMI0 INF = float('inf') float('inf') INF def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split()) def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split()) MI0
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


N, D = MI()

ans = 0
for _ in range(N):
    X, Y = MI()
    if X ** 2 + Y ** 2 <= D ** 2:
        ans += 1
print(ans)