import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mat = lambda x, y, v: [[v]*y for _ in range(x)]
ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)]
mod = 1000000007
sys.setrecursionlimit(1000000)

N, D = rl()
ps = []
for i in range(N):
	x, y = rl()
	ps.append((x,y))

ans = 0
for x, y in ps:
	if x**2+y**2 <= D**2:
		ans += 1
print(ans) import sys, math sys math from collections import defaultdict, deque, Counter from bisect import bisect_left, bisect_right from itertools import combinations, permutations, product from heapq import heappush, heappop from functools import lru_cache input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline rs = lambda: input().strip() rs lambda: input().strip() input().strip() ().strip () input strip ri = lambda: int(input()) ri lambda: int(input()) int(input()) int input() input rl = lambda: list(map(int, input().split())) rl lambda: list(map(int, input().split())) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split [v]*y for _ in range(x) for _ in range(x) _ range(x) range x for _ in range(x) [v]*y [v] v y mat = lambda x, y, v: [[v]*y for _ in range(x)] mat lambda x, y, v: [[v]*y for _ in range(x)] [[v]*y for _ in range(x)] x y v mat(y, z, v) for _ in range(x) for _ in range(x) _ range(x) range x for _ in range(x) mat(y, z, v) mat y z v ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)] ten lambda x, y, z, v: [mat(y, z, v) for _ in range(x)] [mat(y, z, v) for _ in range(x)] x y z v mod = 1000000007 mod 1000000007 sys.setrecursionlimit(1000000) sys.setrecursionlimit sys setrecursionlimit 1000000 N, D = rl() N rl() rl D ps = [] ps [] for i in range(N):
	x, y = rl()
	ps.append((x,y)) i range(N) range N x, y = rl() x rl() rl y ps.append((x,y)) ps.append ps append (x,y) x y ans = 0 ans 0 for x, y in ps:
	if x**2+y**2 <= D**2:
		ans += 1 x y ps 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 x, y = rl() rl() x ri = lambda: int(input()) lambda: int(input()) ri rs = lambda: input().strip() lambda: input().strip() rs rl = lambda: list(map(int, input().split())) lambda: list(map(int, input().split())) rl ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)] lambda x, y, z, v: [mat(y, z, v) for _ in range(x)] ten D = rl() rl() D ps = [] [] ps ans += 1 1 ans input = sys.stdin.readline sys.stdin.readline input N, D = rl() rl() N ans = 0 0 ans mat = lambda x, y, v: [[v]*y for _ in range(x)] lambda x, y, v: [[v]*y for _ in range(x)] mat y = rl() rl() y mod = 1000000007 1000000007 mod
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mat = lambda x, y, v: [[v]*y for _ in range(x)]
ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)]
mod = 1000000007
sys.setrecursionlimit(1000000)

N, D = rl()
ps = []
for i in range(N):
	x, y = rl()
	ps.append((x,y))

ans = 0
for x, y in ps:
	if x**2+y**2 <= D**2:
		ans += 1
print(ans)
