import java.util.*;
import java.io.*;

public class Main{
	// class node implements Comparator<int[]>{
	// 	public int compare(int[] a, int b){
	// 		double d1 = Math.sqrt(Math.pow(a[0],2)+Math.pow(a[1],2));
	// 		double d2 = Math.sqrt(Math.pow(b[0],2)+Math.pow(b[1],2));
	// 		if(d1>d2){
	// 			return 
	// 		}
	// 	}
	// }
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		//int[][] points = new int[n][2];
		int count = 0;
		for(int i=0;i<n;i++){
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		}
		// Arrays.sort(points, new Comparator<int[]>{
		// 	public int compare()
		// });
		System.out.println(count);
	}
} import java.util.*; util.* java import java.io.*; io.* java public class Main{
	// class node implements Comparator<int[]>{
	// 	public int compare(int[] a, int b){
	// 		double d1 = Math.sqrt(Math.pow(a[0],2)+Math.pow(a[1],2));
	// 		double d2 = Math.sqrt(Math.pow(b[0],2)+Math.pow(b[1],2));
	// 		if(d1>d2){
	// 			return 
	// 		}
	// 	}
	// }
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		//int[][] points = new int[n][2];
		int count = 0;
		for(int i=0;i<n;i++){
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		}
		// Arrays.sort(points, new Comparator<int[]>{
		// 	public int compare()
		// });
		System.out.println(count);
	}
} Main // class node implements Comparator<int[]>{
	// 	public int compare(int[] a, int b){
	// 		double d1 = Math.sqrt(Math.pow(a[0],2)+Math.pow(a[1],2));
	// 		double d2 = Math.sqrt(Math.pow(b[0],2)+Math.pow(b[1],2));
	// 		if(d1>d2){
	// 			return 
	// 		}
	// 	}
	// }
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		//int[][] points = new int[n][2];
		int count = 0;
		for(int i=0;i<n;i++){
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		}
		// Arrays.sort(points, new Comparator<int[]>{
		// 	public int compare()
		// });
		System.out.println(count);
	} main {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		//int[][] points = new int[n][2];
		int count = 0;
		for(int i=0;i<n;i++){
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		}
		// Arrays.sort(points, new Comparator<int[]>{
		// 	public int compare()
		// });
		System.out.println(count);
	} BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); br new BufferedReader(new InputStreamReader(System.in)) StringTokenizer st = new StringTokenizer(br.readLine()); st new StringTokenizer(br.readLine()) int n = Integer.parseInt(st.nextToken()); n Integer.parseInt(st.nextToken()) Integer.parseInt Integer st.nextToken() st.nextToken st int k = Integer.parseInt(st.nextToken()); k Integer.parseInt(st.nextToken()) Integer.parseInt Integer st.nextToken() st.nextToken st int count = 0; count 0 for(int i=0;i<n;i++){
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		} int i=0; int i=0; i 0 i<n i n i++ i++ i {
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		} {
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		} st = new StringTokenizer(br.readLine()) st new StringTokenizer(br.readLine()) int x = Integer.parseInt(st.nextToken()); x Integer.parseInt(st.nextToken()) Integer.parseInt Integer st.nextToken() st.nextToken st int y = Integer.parseInt(st.nextToken()); y Integer.parseInt(st.nextToken()) Integer.parseInt Integer st.nextToken() st.nextToken st double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2)); d1 Math.sqrt(Math.pow(x,2)+Math.pow(y,2)) Math.sqrt Math Math.pow(x,2)+Math.pow(y,2) Math.pow(x,2) Math.pow Math x 2 Math.pow(y,2) Math.pow Math y 2 if(d1>k){

			}
			else{
				count++;
			} d1>k d1 k {

			} {
				count++;
			} count++ count System.out.println(count) System.out.println System.out System System.out count String[] args args public class Main{
	// class node implements Comparator<int[]>{
	// 	public int compare(int[] a, int b){
	// 		double d1 = Math.sqrt(Math.pow(a[0],2)+Math.pow(a[1],2));
	// 		double d2 = Math.sqrt(Math.pow(b[0],2)+Math.pow(b[1],2));
	// 		if(d1>d2){
	// 			return 
	// 		}
	// 	}
	// }
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		//int[][] points = new int[n][2];
		int count = 0;
		for(int i=0;i<n;i++){
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		}
		// Arrays.sort(points, new Comparator<int[]>{
		// 	public int compare()
		// });
		System.out.println(count);
	}
} public class Main{
	// class node implements Comparator<int[]>{
	// 	public int compare(int[] a, int b){
	// 		double d1 = Math.sqrt(Math.pow(a[0],2)+Math.pow(a[1],2));
	// 		double d2 = Math.sqrt(Math.pow(b[0],2)+Math.pow(b[1],2));
	// 		if(d1>d2){
	// 			return 
	// 		}
	// 	}
	// }
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		//int[][] points = new int[n][2];
		int count = 0;
		for(int i=0;i<n;i++){
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		}
		// Arrays.sort(points, new Comparator<int[]>{
		// 	public int compare()
		// });
		System.out.println(count);
	}
} Main
import java.util.*;
import java.io.*;

public class Main{
	// class node implements Comparator<int[]>{
	// 	public int compare(int[] a, int b){
	// 		double d1 = Math.sqrt(Math.pow(a[0],2)+Math.pow(a[1],2));
	// 		double d2 = Math.sqrt(Math.pow(b[0],2)+Math.pow(b[1],2));
	// 		if(d1>d2){
	// 			return 
	// 		}
	// 	}
	// }
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		//int[][] points = new int[n][2];
		int count = 0;
		for(int i=0;i<n;i++){
			st = new StringTokenizer(br.readLine());
			int x = Integer.parseInt(st.nextToken());;
			int y = Integer.parseInt(st.nextToken());;
			double d1 = Math.sqrt(Math.pow(x,2)+Math.pow(y,2));
			if(d1>k){

			}
			else{
				count++;
			}
		}
		// Arrays.sort(points, new Comparator<int[]>{
		// 	public int compare()
		// });
		System.out.println(count);
	}
}