import java.util.Scanner;

public class Main {
    public int count(int n, double d, int[][] coords) {
        int count = 0;
        for (int[] coord : coords) {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        }
        return count;
    }

    public static void main(String[] args) throws Exception {
        Main solution = new Main();

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int d = scanner.nextInt();

        int[][] coords = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        }

        int answer = solution.count(n, d, coords);
        System.out.println(answer);
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public int count(int n, double d, int[][] coords) {
        int count = 0;
        for (int[] coord : coords) {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        }
        return count;
    }

    public static void main(String[] args) throws Exception {
        Main solution = new Main();

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int d = scanner.nextInt();

        int[][] coords = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        }

        int answer = solution.count(n, d, coords);
        System.out.println(answer);
    }
} Main public int count(int n, double d, int[][] coords) {
        int count = 0;
        for (int[] coord : coords) {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        }
        return count;
    } count {
        int count = 0;
        for (int[] coord : coords) {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        }
        return count;
    } int count = 0; count 0 for (int[] coord : coords) {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        } int[] coord coords {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        } {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        } double x = coord[0]; x coord[0] coord 0 double y = coord[1]; y coord[1] coord 1 if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            } Math.abs(x) > d || Math.abs(y) > d Math.abs(x) > d Math.abs(x) Math.abs Math x d Math.abs(y) > d Math.abs(y) Math.abs Math y d {
                continue;
            } continue; {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            } double dist = Math.sqrt(x * x + y * y); dist Math.sqrt(x * x + y * y) Math.sqrt Math x * x + y * y x * x x x y * y y y if (dist <= d) {
                    count++;
                } dist <= d dist d {
                    count++;
                } count++ count return count; count int n n double d d int[][] coords coords public static void main(String[] args) throws Exception {
        Main solution = new Main();

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int d = scanner.nextInt();

        int[][] coords = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        }

        int answer = solution.count(n, d, coords);
        System.out.println(answer);
    } main {
        Main solution = new Main();

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int d = scanner.nextInt();

        int[][] coords = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        }

        int answer = solution.count(n, d, coords);
        System.out.println(answer);
    } Main solution = new Main(); solution new Main() Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) int n = scanner.nextInt(); n scanner.nextInt() scanner.nextInt scanner int d = scanner.nextInt(); d scanner.nextInt() scanner.nextInt scanner int[][] coords = new int[n][2]; coords new int[n][2] n 2 for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        } {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        } int x = scanner.nextInt(); x scanner.nextInt() scanner.nextInt scanner int y = scanner.nextInt(); y scanner.nextInt() scanner.nextInt scanner coords[i][0] = x coords[i][0] coords[i] coords i 0 x coords[i][1] = y coords[i][1] coords[i] coords i 1 y int answer = solution.count(n, d, coords); answer solution.count(n, d, coords) solution.count solution n d coords System.out.println(answer) System.out.println System.out System System.out answer String[] args args public class Main {
    public int count(int n, double d, int[][] coords) {
        int count = 0;
        for (int[] coord : coords) {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        }
        return count;
    }

    public static void main(String[] args) throws Exception {
        Main solution = new Main();

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int d = scanner.nextInt();

        int[][] coords = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        }

        int answer = solution.count(n, d, coords);
        System.out.println(answer);
    }
} public class Main {
    public int count(int n, double d, int[][] coords) {
        int count = 0;
        for (int[] coord : coords) {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        }
        return count;
    }

    public static void main(String[] args) throws Exception {
        Main solution = new Main();

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int d = scanner.nextInt();

        int[][] coords = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        }

        int answer = solution.count(n, d, coords);
        System.out.println(answer);
    }
} Main
import java.util.Scanner;

public class Main {
    public int count(int n, double d, int[][] coords) {
        int count = 0;
        for (int[] coord : coords) {
            double x = coord[0];
            double y = coord[1];

            if (Math.abs(x) > d || Math.abs(y) > d) {
                continue;
            } else {
                double dist = Math.sqrt(x * x + y * y);
                if (dist <= d) {
                    count++;
                }
            }
        }
        return count;
    }

    public static void main(String[] args) throws Exception {
        Main solution = new Main();

        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int d = scanner.nextInt();

        int[][] coords = new int[n][2];
        for (int i = 0; i < n; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            coords[i][0] = x;
            coords[i][1] = y;
        }

        int answer = solution.count(n, d, coords);
        System.out.println(answer);
    }
}