import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Arrays;
import java.util.Collections;
import java.util.*;
import java.math.BigInteger;
class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    BigInteger D = scan.nextBigInteger();
    BigInteger X[] = new BigInteger[N];
    BigInteger Y[] = new BigInteger[N];
    int count = 0;
    BigInteger rlt1, rlt2, rlt;
    BigInteger dd = D.multiply(D);
    for (int i = 0;i < N;i++) {
      X[i] = scan.nextBigInteger();
      Y[i] = scan.nextBigInteger();
      rlt1 = X[i].multiply(X[i]);
      rlt2 = Y[i].multiply(Y[i]);
      rlt = rlt1.add(rlt2);
      if (rlt.compareTo(dd)<=0) {
        count += 1;
      }
    }
    System.out.println(count);
  }
} import java.util.Scanner; Scanner java.util import java.util.List; List java.util import java.util.ArrayList; ArrayList java.util import java.util.Comparator; Comparator java.util import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.*; util.* java import java.math.BigInteger; BigInteger java.math class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    BigInteger D = scan.nextBigInteger();
    BigInteger X[] = new BigInteger[N];
    BigInteger Y[] = new BigInteger[N];
    int count = 0;
    BigInteger rlt1, rlt2, rlt;
    BigInteger dd = D.multiply(D);
    for (int i = 0;i < N;i++) {
      X[i] = scan.nextBigInteger();
      Y[i] = scan.nextBigInteger();
      rlt1 = X[i].multiply(X[i]);
      rlt2 = Y[i].multiply(Y[i]);
      rlt = rlt1.add(rlt2);
      if (rlt.compareTo(dd)<=0) {
        count += 1;
      }
    }
    System.out.println(count);
  }
} Main public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    BigInteger D = scan.nextBigInteger();
    BigInteger X[] = new BigInteger[N];
    BigInteger Y[] = new BigInteger[N];
    int count = 0;
    BigInteger rlt1, rlt2, rlt;
    BigInteger dd = D.multiply(D);
    for (int i = 0;i < N;i++) {
      X[i] = scan.nextBigInteger();
      Y[i] = scan.nextBigInteger();
      rlt1 = X[i].multiply(X[i]);
      rlt2 = Y[i].multiply(Y[i]);
      rlt = rlt1.add(rlt2);
      if (rlt.compareTo(dd)<=0) {
        count += 1;
      }
    }
    System.out.println(count);
  } main {
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    BigInteger D = scan.nextBigInteger();
    BigInteger X[] = new BigInteger[N];
    BigInteger Y[] = new BigInteger[N];
    int count = 0;
    BigInteger rlt1, rlt2, rlt;
    BigInteger dd = D.multiply(D);
    for (int i = 0;i < N;i++) {
      X[i] = scan.nextBigInteger();
      Y[i] = scan.nextBigInteger();
      rlt1 = X[i].multiply(X[i]);
      rlt2 = Y[i].multiply(Y[i]);
      rlt = rlt1.add(rlt2);
      if (rlt.compareTo(dd)<=0) {
        count += 1;
      }
    }
    System.out.println(count);
  } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int N = scan.nextInt(); N scan.nextInt() scan.nextInt scan BigInteger D = scan.nextBigInteger(); D scan.nextBigInteger() scan.nextBigInteger scan BigInteger X[] = new BigInteger[N]; X new BigInteger[N] N BigInteger Y[] = new BigInteger[N]; Y new BigInteger[N] N int count = 0; count 0 BigInteger rlt1 rlt1 rlt2 rlt2 rlt; rlt BigInteger dd = D.multiply(D); dd D.multiply(D) D.multiply D D for (int i = 0;i < N;i++) {
      X[i] = scan.nextBigInteger();
      Y[i] = scan.nextBigInteger();
      rlt1 = X[i].multiply(X[i]);
      rlt2 = Y[i].multiply(Y[i]);
      rlt = rlt1.add(rlt2);
      if (rlt.compareTo(dd)<=0) {
        count += 1;
      }
    } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
      X[i] = scan.nextBigInteger();
      Y[i] = scan.nextBigInteger();
      rlt1 = X[i].multiply(X[i]);
      rlt2 = Y[i].multiply(Y[i]);
      rlt = rlt1.add(rlt2);
      if (rlt.compareTo(dd)<=0) {
        count += 1;
      }
    } {
      X[i] = scan.nextBigInteger();
      Y[i] = scan.nextBigInteger();
      rlt1 = X[i].multiply(X[i]);
      rlt2 = Y[i].multiply(Y[i]);
      rlt = rlt1.add(rlt2);
      if (rlt.compareTo(dd)<=0) {
        count += 1;
      }
    } X[i] = scan.nextBigInteger() X[i] X i scan.nextBigInteger() scan.nextBigInteger scan Y[i] = scan.nextBigInteger() Y[i] Y i scan.nextBigInteger() scan.nextBigInteger scan rlt1 = X[i].multiply(X[i]) rlt1 X[i].multiply(X[i]) X[i].multiply X[i] X i X[i] X i rlt2 = Y[i].multiply(Y[i]) rlt2 Y[i].multiply(Y[i]) Y[i].multiply Y[i] Y i Y[i] Y i rlt = rlt1.add(rlt2) rlt rlt1.add(rlt2) rlt1.add rlt1 rlt2 if (rlt.compareTo(dd)<=0) {
        count += 1;
      } rlt.compareTo(dd)<=0 rlt.compareTo(dd) rlt.compareTo rlt dd 0 {
        count += 1;
      } count += 1 count 1 System.out.println(count) System.out.println System.out System System.out count String[] args args
import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Arrays;
import java.util.Collections;
import java.util.*;
import java.math.BigInteger;
class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    BigInteger D = scan.nextBigInteger();
    BigInteger X[] = new BigInteger[N];
    BigInteger Y[] = new BigInteger[N];
    int count = 0;
    BigInteger rlt1, rlt2, rlt;
    BigInteger dd = D.multiply(D);
    for (int i = 0;i < N;i++) {
      X[i] = scan.nextBigInteger();
      Y[i] = scan.nextBigInteger();
      rlt1 = X[i].multiply(X[i]);
      rlt2 = Y[i].multiply(Y[i]);
      rlt = rlt1.add(rlt2);
      if (rlt.compareTo(dd)<=0) {
        count += 1;
      }
    }
    System.out.println(count);
  }
}