import java.util.Scanner;


public class Main {
//	final static int MOD = 1000000007;

	public static long ans = 0;

	public static void main(String[] args) {

//		int ans = 0;
		Scanner sc = new Scanner(System.in);
		boolean f = false;

		int n = sc.nextInt();
		double d = sc.nextDouble();

		long[] a = new long[n];
		long[] b = new long[n];
		for (int i = 0; i < n; i++) {
			a[i]= sc.nextLong();
			b[i]= sc.nextLong();
		}


		//-------------------------------------------------------------------------------------

		for(int i = 0; i < n; i++) {
			long tmpa = (a[i] * a[i]);
			long tmpb = (b[i] * b[i]);
			long tmp = tmpa + tmpb;
			double calc = Math.sqrt(tmp);
			System.err.println(tmpb);
			if(d * d >= tmp) {
				ans++;
			}
		}


		//-------------------------------------------------------------------------------------

//		if(f) {
//			System.out.println("Yes");
//		} else {
//			System.out.println("No");
//		}

		System.out.println(ans);

		sc.close();
	}



}
/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