#include <iostream>
#include <fstream>
using namespace std;
ifstream f("frac.in");
ofstream g("frac.out");
const int MAXP = 1000000;
const int NMAX = 100000;
const int NDIV = 21;

long long int N,P,N2,nt,S;
bool b[MAXP];
int prim[NMAX],lp=0;
int p[NDIV],lg;

void generareNumerePrime()
{
    int i,j;
    for(i=4; i<MAXP; i+=2)
        b[i]=1;
    for(i=3; i*i<MAXP; i+=2)
        if(b[i] == 0)
            for(j = i * i; j < MAXP; j += i)
                b[j] = 1;
    for(i = 2; i < MAXP; i++)
        if(b[i] == 0) prim[++lp] = i;
}


void generareDivizoriN()
{
    lg = 0;
    for(int j = 1; 1LL * prim[j]*prim[j] <= N2; j++)
        if(N2 % prim[j] == 0)
        {
            p[++lg] = prim[j];
            while(N2 % prim[j] == 0) N2 /= prim[j];
        }
    if(N2 > 1) p[++lg] = N2;
}

long long int rez(long long int N)
{
    long long int sol=N;
    for(int i = 1; i < nt; i++)
    {
        long long int prod = 1;
        int j = 0, p2, ndiv = 0;
        while((p2 = 1 << j) <= i)
        {
            if(p2 & i) prod *= - p[j + 1];
            j++;
        }
        sol+=N / prod;
    }
    return sol;
}

int main()
{
    f>>N>>P;
    N2=N;
    generareNumerePrime();
    generareDivizoriN();
    nt = 1 << lg;
    long long int s=1, d=1LL<<61;
    while(s<=d)
    {
        long long int m=(s+d)/2;
        if(rez(m)<P) s=m+1;
        else
        {
            S=m;
            d=m-1;
        }
    }
    g<<S;
    f.close();
    g.close();

    return 0;
}