#include <bits/stdc++.h>
using namespace std;
long long p;
int q;

long long howMany(long long x) {
   long long putere=p;
   long long cnt=0;
   while(putere<=x){
    cnt+=x/putere;
    putere*=p;
   }
   return cnt;
}


int main(){
ifstream cin("gfact.in");
ofstream cout("gfact.out");
cin >> p >> q;
long long left=1,right=6000000000000000,sol=0;
while(left<=right){
    long long mid=left+(right-left)/2;
    if(howMany(mid)>=q){
        sol=mid;
        right=mid-1;
    }
    else{
        left=mid+1;
    }
}
cout << left;


return 0;
}