#include <fstream>

using namespace std;

ifstream f("frac.in");
ofstream g("frac.out");

bool sieve[110000];
int n1, n, i, j, p, p1, prim[100000], k;

void ciur()
{
    for (i = 2; i*i <= 120000000; i++)
    {
        if (!sieve[i])
        {
            k++, prim[k] = i;
            while (n1 % i == 0)
                n1 /= i, sieve[j] = 1;
            for (j = 2*i; j*j <= 120000000; j+= i)
                sieve[j] = 1;
        }
    }
}

int main()
{
    f >> n >> p;
    ciur();
    n1 = n;
    i = 1;
    //while (p1 <= p)
    {
        if (!sieve[prim[i]])
            p++;
        i++;
    }
    return 0;
}