#include <fstream>
#include <climits>
#include <cmath>
#include <map>
#include <vector>

using namespace std;

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

vector <pair< int, unsigned long long> > Div;

int p, q, r;

bool test(unsigned long long val)
{
    for(int i = 0; i < Div.size(); ++i)
    {
        unsigned long long rez = 0;
        unsigned long long P = Div[i].first;
        while(val / P != 0)
        {
            rez += val / P;
            P *= Div[i].first;
        }
        if(rez < Div[i].second)
            return 0;
    }

    return 1;
}

int main()
{
    fin >> p >> q;

    int d = 2;
    int cp = p;
    while(p > 1)
    {
        int e = 0;
        while(p % d == 0)
        {
            ++e;
            p /= d;
        }

        if(e * q != 0)
            Div.push_back({d, e * q});
        ++d;
    }
    p = cp;

    r = sqrt(p);
    unsigned long long rez = 0;
    unsigned long long st = 1;
    unsigned long long dr = 2000000000000000;
    while(st <= dr)
    {
        unsigned long long mij = (st + dr) / 2;
        if(test(mij))
        {
            rez = mij;
        }
        else st = mij + 1;
            dr = mij - 1;
    }
    fout << rez << '\n';
    return 0;
}