import java.util.Scanner;

/**
 * B - Distance
 */
public class Main {

    public static void main( String[] args ) {

        Scanner sc = new Scanner( System.in );
        // 入力値
        int n = sc.nextInt(); // 2次元平面上にある点の数
        int d = sc.nextInt(); // 原点からD以下の点を求める

        int result = 0;
        for( int i = 0; i < n; i++ ) {
            double calc = Math.sqrt( Math.pow( sc.nextInt(), 2 ) + Math.pow( sc.nextInt(), 2 ) );
            if( calc <= d ) result++;
        }

        System.out.println( result );

        sc.close();
    }
}
/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