import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log,gcd
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
'''
#Pythonを用いる場合
#numpy 1.18.0, scipy 1.4.1, scikit-learn 0.22, numba 0.47.0, networkx 2.4
 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
'''
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

n,d=mii()

cnt=0

for i in range(n):
    x,y=mii()

    if d*d >=x**2 +y**2:
        cnt+=1

print(cnt) import sys sys sys.setrecursionlimit(10**6) sys.setrecursionlimit sys setrecursionlimit 10**6 10 6 from math import floor,ceil,sqrt,factorial,log,gcd from heapq import heappop, heappush, heappushpop from collections import Counter,defaultdict,deque from itertools import accumulate,permutations,combinations,product,combinations_with_replacement from bisect import bisect_left,bisect_right from copy import deepcopy from operator import itemgetter from fractions import gcd mod = 10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 inf = float('inf') inf float('inf') float 'inf' ninf = -float('inf') ninf -float('inf') float('inf') float 'inf' '''
#Pythonを用いる場合
#numpy 1.18.0, scipy 1.4.1, scikit-learn 0.22, numba 0.47.0, networkx 2.4
 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
''' def ii(): return int(sys.stdin.readline().rstrip()) #int(input()) ii def mii(): return map(int,sys.stdin.readline().rstrip().split()) mii def limii(): return list(mii()) #list(map(int,input().split())) limii ii() for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) ii() ii def lin(n:int): return [ii() for _ in range(n)] lin n:int n limii() for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) limii() limii def llint(n: int): return [limii() for _ in range(n)]
#文字列input llint n: int n def ss(): return sys.stdin.readline().rstrip() #input() ss def mss(): return sys.stdin.readline().rstrip().split() mss def limss(): return list(mss()) #list(input().split()) limss ss() for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) ss() ss def lst(n:int): return [ss() for _ in range(n)] lst n:int n limss() for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) limss() limss def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？ llstr n: int n n,d=mii() n mii() mii d cnt=0 cnt 0 for i in range(n):
    x,y=mii()

    if d*d >=x**2 +y**2:
        cnt+=1 i range(n) range n x,y=mii() x mii() mii y if d*d >=x**2 +y**2:
        cnt+=1 d*d >=x**2 +y**2 d*d d d x**2 +y**2 x**2 x 2 y**2 y 2 cnt+=1 cnt 1 print(cnt) print cnt def ii(): return int(sys.stdin.readline().rstrip()) #int(input()) def ii(): return int(sys.stdin.readline().rstrip()) #int(input()) ii inf = float('inf') float('inf') inf def limii(): return list(mii()) #list(map(int,input().split())) def limii(): return list(mii()) #list(map(int,input().split())) limii def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？ def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？ llstr ninf = -float('inf') -float('inf') ninf def limss(): return list(mss()) #list(input().split()) def limss(): return list(mss()) #list(input().split()) limss d=mii() mii() d x,y=mii() mii() x def mii(): return map(int,sys.stdin.readline().rstrip().split()) def mii(): return map(int,sys.stdin.readline().rstrip().split()) mii def ss(): return sys.stdin.readline().rstrip() #input() def ss(): return sys.stdin.readline().rstrip() #input() ss def lin(n:int): return [ii() for _ in range(n)] def lin(n:int): return [ii() for _ in range(n)] lin cnt=0 0 cnt cnt+=1 1 cnt def lst(n:int): return [ss() for _ in range(n)] def lst(n:int): return [ss() for _ in range(n)] lst n,d=mii() mii() n def llint(n: int): return [limii() for _ in range(n)]
#文字列input def llint(n: int): return [limii() for _ in range(n)]
#文字列input llint mod = 10 ** 9 + 7 10 ** 9 + 7 mod y=mii() mii() y def mss(): return sys.stdin.readline().rstrip().split() def mss(): return sys.stdin.readline().rstrip().split() mss
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log,gcd
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
'''
#Pythonを用いる場合
#numpy 1.18.0, scipy 1.4.1, scikit-learn 0.22, numba 0.47.0, networkx 2.4
 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
'''
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

n,d=mii()

cnt=0

for i in range(n):
    x,y=mii()

    if d*d >=x**2 +y**2:
        cnt+=1

print(cnt)