// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std, core.bitop;
// dfmt on
void main()
{
    auto input = stdin.byLine.map!split.joiner;

    long N;
    N = input.front.to!long;
    input.popFront;

    long D;
    D = input.front.to!long;
    input.popFront;

    long[] X = new long[](cast(size_t)(N));
    long[] Y = new long[](cast(size_t)(N));
    foreach (i; 0 .. cast(size_t)(N))
    {
        X[i] = input.front.to!long;
        input.popFront;
        Y[i] = input.front.to!long;
        input.popFront;
    }

    solve(N, D, X, Y);
}

void solve(long N, long D, long[] X, long[] Y)
{
    long ans;
    foreach (i; 0 .. N)
    {
        ans += (X[i] ^^ 2 + Y[i] ^^ 2) <= D ^^ 2;
    }
    writeln(ans);
}
