#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<queue> using namespace std; queue<int> q2,q3; int main() { int a,n,ans; while(cin>>a>>n) { if(n==1) { cout<<a; return 0; } q2.push(2*a+1); q3.push(3*a+1); n-=2; while(n) { n--; if(q2.front()==q3.front()) { q2.push(2*q2.front()+1); q3.push(3*q3.front()+1); q2.pop(); q3.pop(); } else if(q2.front()<q3.front()) { q2.push(2*q2.front()+1); q3.push(3*q2.front()+1); q2.pop(); } else { q2.push(2*q3.front()+1); q3.push(3*q3.front()+1); q3.pop(); } } if(q2.front()<q3.front()) cout<<q2.front(); else cout<<q3.front(); } return 0; }