#                               #
    # author : samars_diary #
    # 17-09-2020 │ 16:08:30 #
#                               #

import sys, os.path, math

#if(os.path.exists('input.txt')):
    #sys.stdin = open('input.txt',"r")
    #sys.stdout = open('output.txt',"w")

sys.setrecursionlimit(10 ** 5)

def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write

def solve():
    n,d=mii();c=0
    for _ in range(n):
        a,b=mii()
        if math.sqrt((a**2)+(b**2))<=d:
            c+=1
    print(c)
for _ in range(1):
    solve() import sys, os.path, math sys os.path math sys.setrecursionlimit(10 ** 5) sys.setrecursionlimit sys setrecursionlimit 10 ** 5 10 5 def mod(): return 10**9+7 mod def i(): return sys.stdin.readline().strip() i def ii(): return int(sys.stdin.readline()) ii def li(): return list(sys.stdin.readline().strip()) li def mii(): return map(int, sys.stdin.readline().split()) mii def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write lii def solve():
    n,d=mii();c=0
    for _ in range(n):
        a,b=mii()
        if math.sqrt((a**2)+(b**2))<=d:
            c+=1
    print(c) solve n,d=mii() n mii() mii d c=0 c 0 for _ in range(n):
        a,b=mii()
        if math.sqrt((a**2)+(b**2))<=d:
            c+=1
     _ range(n) range n a,b=mii() a mii() mii b if math.sqrt((a**2)+(b**2))<=d:
            c+=1
     math.sqrt((a**2)+(b**2))<=d math.sqrt((a**2)+(b**2)) math.sqrt math sqrt (a**2)+(b**2) a**2 a 2 b**2 b 2 d c+=1 c 1 print(c) print c for _ in range(1):
    solve() _ range(1) range 1 solve() solve def solve():
    n,d=mii();c=0
    for _ in range(n):
        a,b=mii()
        if math.sqrt((a**2)+(b**2))<=d:
            c+=1
    print(c) def solve():
    n,d=mii();c=0
    for _ in range(n):
        a,b=mii()
        if math.sqrt((a**2)+(b**2))<=d:
            c+=1
    print(c) solve def i(): return sys.stdin.readline().strip() def i(): return sys.stdin.readline().strip() i def li(): return list(sys.stdin.readline().strip()) def li(): return list(sys.stdin.readline().strip()) li def mod(): return 10**9+7 def mod(): return 10**9+7 mod def ii(): return int(sys.stdin.readline()) def ii(): return int(sys.stdin.readline()) ii def mii(): return map(int, sys.stdin.readline().split()) def mii(): return map(int, sys.stdin.readline().split()) mii def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write lii
#                               #
    # author : samars_diary #
    # 17-09-2020 │ 16:08:30 #
#                               #

import sys, os.path, math

#if(os.path.exists('input.txt')):
    #sys.stdin = open('input.txt',"r")
    #sys.stdout = open('output.txt',"w")

sys.setrecursionlimit(10 ** 5)

def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write

def solve():
    n,d=mii();c=0
    for _ in range(n):
        a,b=mii()
        if math.sqrt((a**2)+(b**2))<=d:
            c+=1
    print(c)
for _ in range(1):
    solve()