#include <cstdio>
using namespace std;
#define ull unsigned long long
#define ll long long
const int MAXD = 11;
long long div[MAXD + 5];
int divizori(long long n){
    int d, nrdiv = 0;
    if (n % 2 == 0){
        div[++nrdiv] = 2;
        while (n % 2 == 0)
            n /= 2;
    }
    for (d = 3; d * d <= n; d += 2){
        if (n % d == 0){
            div[++nrdiv] = d;
            while (n % d == 0)
                n /= d;
        }
    }
    if (n > 1)
        div[++nrdiv] = n;
    return nrdiv;
}
ull submultimi(ull a, int nrdiv){
    int ns = (1 << nrdiv) - 1, i, j, nr, prod;
    ull ans = a;
    for (i = 1; i <= ns; i ++){
        prod = 1;
        nr = 0;
        for (j = 0; j <= nrdiv; j ++)
            if ((1 << j) & i){
                nr ++;
                prod *= div[j + 1];
            }
        if (nr & 1)
            ans -= a / prod;
        else
            ans += a / prod;
    }
    return ans;
}
ull bs(ull st, ull dr, ll p, int nrdiv){
    ull med, last = -1, ans;
    while (st <= dr){
        med = (st + dr) >> 1;
        ans = submultimi(med, nrdiv);
        if (ans < p){
            st = med + 1;
        }
        else{
            last = med;
            dr = med - 1;
        }
    }
    return last;
}
int main(){
    freopen("frac.in", "r", stdin);
    freopen("frac.out", "w", stdout);
    int nrdiv;
    ll n, p;
    scanf("%lld%lld", &n, &p);
    nrdiv = divizori(n);
    printf("%llu", bs(1, 1LLU * 1 << 61, p, nrdiv));
    return 0;
}