//mai intai m-am gandit problema ca o problema mai simpla adica P sa fie numar prim 
// am folosit formula lui Legendre
//dupa am reusit sa fac porblema toata
//si am cautat solutia binar
//si am facut niste optimizarti pe ici si colo

#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("gfact.in");
ofstream g("gfact.out");

int formulaluiLegrendre(int B, int P){
    int putere = P, cnt =0;
      while(putere <= B){
        cnt+= B/putere;
        putere*=P;
      }
      return cnt;
}

int cautareabinara(int p, int q){
    long long left=1, right = q;
    long long sol = 0 ;

    while(left<= right){
      long long mid = (left+right)/2;
      if(formulaluiLegrendre(mid*p, p) >= q){
          sol = mid;
          right = mid - 1;
      }
      else {
        left = mid + 1;
      }
    }
    return sol*p;
}
int main(){
    int  P, Q;
    f>>P>>Q;
    int solb=0;
    int d=2;
    int putere;
    int p2=P;
    while(p2!=1){
      putere=0;
      while(p2 % d == 0){
        p2/=d;
        putere++;
      }
      if(putere>0) {
          int p = d;
          int q = putere*Q;
          int nr=cautareabinara(p , q);
          solb = max(solb, nr);
      }
      d++;
    }
    g<< solb;
}