import java.util.Scanner;
import java.lang.Math;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int d = scan.nextInt();
        int counter = 0;
        int[] array = new int[n*2];
        for(int a=0; a<n*2; a=a+2){
            array[a] = scan.nextInt();
            array[a+1] = scan.nextInt();
            if(Math.sqrt(Math.pow(array[a],2)+Math.pow(array[a+1],2))<=d){
                counter++;
            }
        }
        System.out.println(counter);
        scan.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