{-#LANGUAGE FlexibleContexts#-}
import Control.Monad.State
import Control.Monad.Reader
import Control.Arrow
-- import Control.Comonad
import Data.Maybe
import Data.List
import Data.Bool
import Data.Fixed
import Data.Tuple
import qualified Data.Map.Strict as M
import qualified Data.Array.IO as IA
import qualified Data.Vector as V

getIn = read <$> getLine :: IO Int
getIns = map read . words <$> getLine :: IO [Int]
getInt = read <$> getLine :: IO Integer
getInts = map read . words <$> getLine :: IO [Integer]

type Row = Integer
type Col = Integer
type Point = (Integer, Integer)

mmm = 1000000007
factorial 0 s = s
factorial n s = factorial (n - 1) (s * n)
fact' n = factorial n 1
fi = fromInteger

-- 
--
--
--
-- Xn = x^(n+1) - 3

burgurSize num = 2 ^ (num + 2) - 3
pattiNum num = 2 ^ (num + 1) - 1
eatableSize :: Integer -> Integer
eatableSize num = toInteger $ flip (-) 2 . truncate $ logBase 2 (fi num + 3) 

eat layer gabu
    | gabu < 1 = 0
    | layer == 1 = do
        if gabu > 5 then 3 + eat 1 (gabu - 6) + 1
        else if gabu < 2 then 0
        else min 3 $ gabu - 1
    | eatableSize gabu < layer = eat (layer - 1) (gabu - 1) -- gabuが-1なのは一番外側のバンズを食べないと内側のパティまで届かないから
    | otherwise = do
        let nokoriGabu = gabu - (burgurSize layer) - 1
        if nokoriGabu < 0 then pattiNum layer
        else pattiNum layer + eat layer nokoriGabu + 1 -- 最後の1はＮ−１バーガーの間に挟まるパティ

main = do
    [l, g] <- getInts
    putStrLn . show $ min (pattiNum l) (eat l g)
