import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main {

	
	public static void main(String[] args) {
		
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int d = s.nextInt();
		int ctr = 0;
		while(n--!=0) {
			int a = s.nextInt();
			int b = s.nextInt();
			
			if((Math.sqrt(Math.pow(a, 2)+Math.pow(b,2)))<=d) {
				ctr++;
			}
		}
		System.out.println(ctr);
	}

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