///Nume:Huminic Angel
///Scoala: CNAS
///clasa 10
///email: [email protected]
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("divprim.in");
ofstream fout("divprim.out");

int prim(int n)
{
    if(n<2 || n>2 && n%2==0)
        return 0;
    for(int d=3;d*d<n;d=d+2)
        if(n%d==0)
        return 1;
    return 0;
}

int nrdiv(int n)
{
    int nr=0,d;
    for(d=1;d*d<=n;d++)
        nr=nr+2;
    if(d*d==n)
        nr++;
    return nr;

}
int nrdivprimi(int n)
{
    int divprim=0,d;
    if(d=prim(n))
        divprim++;
    return divprim;
}

int main()
{
    long long n,N,T,K,X;
    fin>>T;
    fin>>N>>K;
    if(X==nrdivprimi(n)&& X<=N)
        fout<<X;
    else
        fout<<0;

    return 0;
}