import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]


def main():
    N,M = map(int,input().split())
    if N < 70:
        mx = pow(2,N-1)
        if mx <= M:
            ans = mx*2-1
            print(ans);exit()
    A = [M]
    nokori = 0
    for i in range(N-1):
        if A[-1]%2 == 0:
            A.append(A[-1]//2)
        else:
            A.append((A[-1]+1)//2)
        if A[-1] == 1:
            nokori = N - len(A)
            break
    #print(A)
    ans = sum(A) + nokori
    print(ans)

if __name__ == '__main__':
    main()