#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define INF 10000000
#define ll long long
using namespace std;
ll p, q, st, dr, mid, sol;
vector<pair<ll, ll> >primes;
void factorizare(int nr)
{
    int d = 2, fm = 0;
    do
    {
        fm = 0;
        while(nr % d == 0)
        {
            fm++;
            nr /= d;
        }
        if(fm > 0)
        {
            primes.push_back({d, fm * q});
        }
        d = d + 1 + (d & 1);
        if(d * d > nr)
        {
            d = nr;
        }
    }while(nr > 1);
}
ll legendre(int val, int baza)
{
    ll ans = 0;
    while(val > 1)
    {
        ans += 1ll * val / baza;
        val /= baza;
    }
    return ans;
}
ifstream fin("gfact.in");
ofstream fout("gfact.out");
int32_t main(int argc, char * argv[])
{
    fin >> p >> q;
    factorizare(p);
    st = 1, dr = INF, mid = 0;
    while(st <= dr)
    {
        mid = (st + dr) / 2;
        bool verif = true;
        for(int j = 0; j < primes.size(); ++j)
        {
            if(legendre(mid, primes[j].first) < primes[j].second)
            {
                verif = false;
                break;
            }
        }
        if(verif)
        {
            sol = mid;
            dr = mid - 1;
        }
        else
        {
            st = mid + 1;
        }
    }
    fout << sol;
    return 0;
}