#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline ll time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m; cin >> n >> m;
    if(n <= 30 and (1LL<<(n-1)) <= m){
        cout << (1LL<<n)-1 << endl;
        return 0;
    }
    vector<int> v;
    while(m > 1){
        v.push_back(m);
        if(m%2){
            m = (m+1)/2;
        }
        else{
            m /= 2;
        }
    }
    v.push_back(1);
    reverse(v.begin(), v.end());
    ll res = 0;
    for(int i=0;i<v.size();i++){
        if(n > 0){
            res += v[i];
            n--;
        }
    }
    res += n;
    cout << res << endl;
}