#include<iostream> #include<cstdio> #define yc sanm using namespace std; const int N=100010; int q[N],a,n; int main() { while(cin>>a>>n){ int cur = 2; q[1]=a; int p2=1,p3=1; while(cur<=n) { int res1=q[p2]*2+1,res2=q[p3]*3+1; if(res1<res2) p2++; else p3++; if(!(min(res1,res2)==q[cur-1])) q[cur++]=min(res1,res2); } cout<<q[n]<<endl; } return 0; }