import java.util.*;

class Main{

  public static void main(String args[]){

    Scanner s=new Scanner(System.in);
    int N=s.nextInt();
    long D=s.nextLong();
    D=D*D;
    int ans=0;
    long[][] point=new long[N][2];
    for(int i=0;i<N;i++){
      for(int j=0;j<2;j++){
        point[i][j]=s.nextLong();
        point[i][j]=point[i][j]*point[i][j];
      }
      if (point[i][0]+point[i][1]<=D){ans+=1;}
    }
    
    
    System.out.println(ans);
  }  
}
/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