import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            Long d = Long.parseLong(in.next());
            long[] x = new long[n];
            long[] y = new long[n];
            for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            }
            int ans = 0;
            double distance = 0;
            for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            Long d = Long.parseLong(in.next());
            long[] x = new long[n];
            long[] y = new long[n];
            for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            }
            int ans = 0;
            double distance = 0;
            for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) B solver = new B(); solver new B() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            Long d = Long.parseLong(in.next());
            long[] x = new long[n];
            long[] y = new long[n];
            for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            }
            int ans = 0;
            double distance = 0;
            for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            }
            // 出力
            out.println(ans);

        }

    } B public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            Long d = Long.parseLong(in.next());
            long[] x = new long[n];
            long[] y = new long[n];
            for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            }
            int ans = 0;
            double distance = 0;
            for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            }
            // 出力
            out.println(ans);

        } solve {
            // 入力
            int n = Integer.parseInt(in.next());
            Long d = Long.parseLong(in.next());
            long[] x = new long[n];
            long[] y = new long[n];
            for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            }
            int ans = 0;
            double distance = 0;
            for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            }
            // 出力
            out.println(ans);

        } int n = Integer.parseInt(in.next()); n Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in Long d = Long.parseLong(in.next()); d Long.parseLong(in.next()) Long.parseLong Long in.next() in.next in long[] x = new long[n]; x new long[n] n long[] y = new long[n]; y new long[n] n for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            } {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            } x[i] = Long.parseLong(in.next()) x[i] x i Long.parseLong(in.next()) Long.parseLong Long in.next() in.next in y[i] = Long.parseLong(in.next()) y[i] y i Long.parseLong(in.next()) Long.parseLong Long in.next() in.next in int ans = 0; ans 0 double distance = 0; distance 0 for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            } {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            } distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i])) distance Math.sqrt((x[i] * x[i]) + (y[i] * y[i])) Math.sqrt Math (x[i] * x[i]) + (y[i] * y[i]) (x[i] * x[i]) x[i] x i x[i] x i (y[i] * y[i]) y[i] y i y[i] y i if (distance <= (double) d) ans++; distance <= (double) d distance (double) d ans++ ans out.println(ans) out.println out ans int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            Long d = Long.parseLong(in.next());
            long[] x = new long[n];
            long[] y = new long[n];
            for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            }
            int ans = 0;
            double distance = 0;
            for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            Long d = Long.parseLong(in.next());
            long[] x = new long[n];
            long[] y = new long[n];
            for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            }
            int ans = 0;
            double distance = 0;
            for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            Long d = Long.parseLong(in.next());
            long[] x = new long[n];
            long[] y = new long[n];
            for (int i = 0; i < n; i++) {
                x[i] = Long.parseLong(in.next());
                y[i] = Long.parseLong(in.next());
            }
            int ans = 0;
            double distance = 0;
            for (int i = 0; i < n; i++) {
                distance = Math.sqrt((x[i] * x[i]) + (y[i] * y[i]));
//            out.println(distance);
                if (distance <= (double) d) ans++;
            }
            // 出力
            out.println(ans);

        }

    }
}

