n, m = map(int, input().split())

if m == 1:
    print(n)
else:
    path_backward = []
    current = m
    while True:
        path_backward.append(current)
        if current == 1:
            break
        if current % 2 == 0:
            current //= 2
        else:
            current = (current + 1) // 2
    path_forward = list(reversed(path_backward))
    k = len(path_forward)
    if n <= k:
        total = sum(path_forward[:n])
    else:
        total = sum(path_forward) + (n - k)
    print(total)