#include<bits/stdc++.h> using namespace std; long long awa[1000000]; int main(){ int a,n; while(cin>>a>>n){ int qwq=2; awa[1]=a; int to=1,te=1; while(qwq<=n){ long long t1=awa[to]*2+1,t2=awa[te]*3+1; int b=min(t1,t2); if(t1<t2){ to++; } else{ te++; } if(b==awa[qwq-1])continue; awa[qwq++]=b; } cout<<awa[n]<<endl; } return 0; }