import java.util.Scanner;

public class Main {
    public static Scanner in = new Scanner(System.in);

    public static void main(String[] args) {
        int points = in.nextInt();
        long dist = in.nextLong();
        dist = dist * dist;

        int answer = 0;
        for (int i = 0; i < points; i++) {
            long p = in.nextLong();
            long q = in.nextLong();
            long d = (p * p) + (q * q);
            if (d <= dist) answer += 1;
        }

        System.out.println(answer);
    }
}
/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