import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from scipy.sparse.csgraph import floyd_warshall
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7

def main():
    n,d = map(int,input().split())
    ans = 0
    for _ in range(n):
        x,y = map(int,input().split())
        if (x**2 + y**2)**0.5 <= d:
            ans += 1
    print(ans)
    
if __name__ == "__main__":
    main() import sys, bisect, math, itertools, string, queue, copy sys bisect math itertools string queue copy from collections import Counter,defaultdict,deque from itertools import permutations, combinations, combinations_with_replacement from heapq import heappop, heappush, heapify from fractions import gcd sys.setrecursionlimit(10**8) sys.setrecursionlimit sys setrecursionlimit 10**8 10 8 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 def main():
    n,d = map(int,input().split())
    ans = 0
    for _ in range(n):
        x,y = map(int,input().split())
        if (x**2 + y**2)**0.5 <= d:
            ans += 1
    print(ans)
     main n,d = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split d ans = 0 ans 0 for _ in range(n):
        x,y = map(int,input().split())
        if (x**2 + y**2)**0.5 <= d:
            ans += 1
     _ range(n) range n x,y = map(int,input().split()) x map(int,input().split()) map int input().split() ().split () input split y if (x**2 + y**2)**0.5 <= d:
            ans += 1
     (x**2 + y**2)**0.5 <= d (x**2 + y**2)**0.5 x**2 + y**2 x**2 x 2 y**2 y 2 0.5 d ans += 1 ans 1 print(ans) print ans if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main mod = 10**9+7 10**9+7 mod def main():
    n,d = map(int,input().split())
    ans = 0
    for _ in range(n):
        x,y = map(int,input().split())
        if (x**2 + y**2)**0.5 <= d:
            ans += 1
    print(ans)
     def main():
    n,d = map(int,input().split())
    ans = 0
    for _ in range(n):
        x,y = map(int,input().split())
        if (x**2 + y**2)**0.5 <= d:
            ans += 1
    print(ans)
     main
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from scipy.sparse.csgraph import floyd_warshall
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7

def main():
    n,d = map(int,input().split())
    ans = 0
    for _ in range(n):
        x,y = map(int,input().split())
        if (x**2 + y**2)**0.5 <= d:
            ans += 1
    print(ans)
    
if __name__ == "__main__":
    main()