pku2773 Happy 2006

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 1000111;

vector<int>p;
bool yes[maxn];
int m,k;

bool isp(int x)
{
	int temp = sqrt(double(x));
	for(int i=0;i<p.size();i++)
	{
		if(p[i]>temp)
		{
			return true;
		}
		if(x%p[i]==0)
		{
			return false;
		}
	}
	assert(false);
}

void init()
{
	p.clear();
	p.pb(2);
	for(int i=3;i<100000;i++)
	{
		if(isp(i))
		{
			p.pb(i);
		}
	}
	return ;
}

vector<int>v;

i64 gao()
{
	if(1==m)
	{
		return k;
	}
	v.clear();
	int temp = m;
	bool ok;
	for(int i=0;p[i]*p[i]<=temp;i++)
	{
		ok = false;
		while(temp%p[i]==0)
		{
			temp /= p[i];
			if(!ok)
			{
				v.pb(p[i]);
				ok = true;
			}
		}
	}
	if(temp!=1)
	{
		v.pb(temp);
	}
	for(int i=0;i<=m;i++)
	{
		yes[i]=false;
	}
	for(int i=0;i<v.size();i++)
	{
		temp = v[i];
		while(temp<m)
		{
			yes[temp] = true;
			temp+=v[i];
		}
	}
	int f=0;
	v.clear();
	for(int i=1;i<m;i++)
	{
		if(!yes[i])
		{
			f++;
			v.pb(i);
		}
	}
	temp = k/f;
	k %= f;
	if(k==0)
	{
		temp--;
		k = f;
	}
	i64 ans;
	ans = temp;
	ans *= m;
	ans += v[k-1];
	return ans;
}

int main()
{
	init();
	while(cin>>m>>k)
	{
		cout<<gao()<<endl;
	}
    return 0;
}