#include <bits/stdc++.h> using namespace std; #define int long long const int N = 1e6 + 1000; int a[N]; void work(int n , int m) { int r = 2; a[1] = n; int tw = 1 , th = 1; while(r <= m) { int p = a[tw] * 2 + 1; int q = a[th] * 3 + 1; int t = min(p , q); if(p < q) tw++; else th++; if(t == a[r - 1]) continue; a[r] = t; } cout << a[m] << endl; } signed main() { int n , m; while(cin >> n >> m) work(n , m); return 0; }