import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.next());
		int D = Integer.parseInt(scan.next());
		int[] X = new int[N];
		int[] Y = new int[N];
		int ans = 0;
		for (int n = 0;n < N ;n++ ) {
			X[n] = Integer.parseInt(scan.next());
			Y[n] = Integer.parseInt(scan.next());
			long xx = (long)Math.pow(X[n], 2);
			long yy = (long)Math.pow(Y[n], 2);
			if (Math.sqrt(xx + yy) <= D) {
				ans++;
			}
		}
		scan.close();
		System.out.println(ans);
	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz