#include <fstream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
ifstream fin ("frac.in");
ofstream fout("frac.out");
long long t,F[4000005],n,x,sol,k,p,P,A,B;
long long v[50],D[50];
vector <long long> prime;
void precalc()
{
    F[0]=2;
    F[1]=2;
    for(int i=2;i<=3000000;i++)
    {
        if(!F[i])
        {
            F[i]=1;
            prime.push_back(i);
            for(int j=i+i;j<=3000000;j+=i)
                F[j]=2;
        }
    }
}
void backtrack(int pas,int ant,long long nr)
{
    if(ant+1<=k)
    {
        for(int i=ant+1;i<=k;i++)
        {
            v[pas]=D[i];
            P*=D[i];
            backtrack(pas+1,i,nr);
            //fout<<P<<"\n";
            if(pas%2)
                sol+=nr/P;
            else
                sol-=nr/P;
            P/=D[i];
        }
    }
}
long long verif(long long nr)
{
    P=1;
    sol=0;
    backtrack(1,0,nr);
    //fout<<sol<<"\n";
    return nr-sol;
}
int main()
{
    precalc();
    memset(F,0,sizeof(F));
    fin>>n>>p;
    int ind=0;
    k=0;
    while(n!=1&&ind<prime.size())
    {
        if(n%prime[ind]==0)
        {
            D[++k]=prime[ind];
            while(n%prime[ind]==0)
                n/=prime[ind];
        }
        ind++;
    }
    if(n>1&&ind==prime.size())
        D[++k]=n;
    long long st=1;
    long long dr=(1LL<<60);
    while(st<=dr)
    {
        long long mid=(st+dr)/2;
        long long x=verif(mid);
        if(x<p)
            st=mid+1;
        else
            dr=mid-1;
    }
    fout<<st;
    return 0;
}