#include <fstream>
#include <iostream>
using namespace std;

#define MAX_CIUR 120000

uint64_t nr, s=0, factori[30];

int prime[78500];
int ans[78500];
bool isprim [1000001];

ifstream in ("frac.in");
ofstream out ("frac.out");

void gen ()
{
    int t=0;
    int i, j;
    for (i = 2; i <= MAX_CIUR; ++i)
        isprim[i] = 1;
    for (i = 2; i <= MAX_CIUR; ++i)
        if (isprim[i])
        {
            for (j = i+i; j <= MAX_CIUR; j += i)
                isprim[j] = 0;
            prime[t]=i;
            t++;
        }
}

void factprimi (uint64_t b)
{
    int i = 0;
    nr = 0;
    while (i <= 78500 && prime[i] != 0)  //dc am ajuns la capat si prime[i]=0 nu trebe sa impartim la 0
    {
            if(b%prime[i]==0)
            {
                factori[nr]=prime[i];
                ++nr;
                while(b%prime[i]==0)
                    b=b/prime[i];  //scapam de divizorii primi in plus
            }
            else
                ++i;
    }
    if(b>MAX_CIUR)
        {
            factori[nr]=b;
            b=1;
            nr++;
        }
}

uint64_t pinex(uint64_t a)
{
    long long unsigned int sol=0, p, cnt;
        for (int i=1; i < (1<<nr); ++i)
        {
            p=1;
            cnt=0;
            for(int j = 0; j < nr; ++j)
                if((1<<j) & i)
                    {
                        p=1LL*p*factori[j];
                        ++cnt;
                    }
            if(cnt%2==1)
                sol=sol+a/p;
            else
                sol=sol-a/p;
        }
    return sol;
}

int64_t cmmdc(int64_t a, int64_t b)
{
    int64_t r;
    while(b!=0)
    {
        r=a%b;
        a=b;
        b=r;
    }
    return a;
}

uint64_t cautbin_hi(uint64_t x)
{
    int st = 1, dr=1 , mid;
    dr=dr<<61;

    while (st < dr)
    {
        mid = (st + dr)/2;
        if (mid - pinex(mid) >= x)
            dr = mid;
        else
            st = mid + 1;
    }
    return st;
}

uint64_t cautbin_lo(uint64_t x)
{
    int st = 1, dr=1 , mid;
    dr=dr<<61;

    while (st < dr)
    {
        mid = (st + dr)/2;
        if(mid - pinex(mid) <=x )
            st = mid + 1;
        else
            dr = mid;
    }
    return st;
}
int main()
{
    uint64_t cautat, lo, hi, b;
    gen ();
    in>>b>>cautat;
    factprimi(b);
    lo = cautbin_lo(cautat - 1);
    hi = cautbin_hi(cautat + 1);
    //cout<<lo<<" "<<hi;
    for (int i = lo; i <= hi; ++i)
    {
        if(cmmdc(b, i)==1)
        {
            out<<i;
            break;
        }
    }
    in.close();
    out.close();
    return 0;
}