{-# LANGUAGE BangPatterns #-}


import qualified Data.Vector.Unboxed as U
import qualified Data.Vector as V
import qualified Data.ByteString.Char8 as C
import Debug.Trace
import Data.List
import Control.Monad
import Data.Ord
import qualified Data.Sequence as Seq
import qualified Data.IntSet as IS
import qualified Data.Set as S

r :: Int -> IO (U.Vector Int)
r n = U.unfoldrN n (C.readInt . C.dropWhile (==' ')) <$> C.getLine

r' :: IO [Int]
r'  =   unfoldr    (C.readInt . C.dropWhile (==' ')) <$> C.getLine

rp :: IO (Int,Int)
rp  = toTup . unfoldr    (C.readInt . C.dropWhile (==' ')) <$> C.getLine

toTup [a,b] = (a,b)


mdl :: Num a => a
mdl = 10^9 + 7

main :: IO ()
main = do
    [n,a,b] <- r' :: IO [Int]
    let al = fromIntegral $ (2^n - 1 :: Integer) `mod` mdl :: Int
    let na = choose n a `mod` mdl
    let nb = choose n b `mod` mdl
    print al
    print na
    print nb
    print $ positivize $ al - na - nb


positivize x = if x < 0 then x + mdl else x


choose :: Int -> Int -> Int
choose n i = (prod' $ ctest n i) * (prodInv' $ V.generate i succ)

ctest :: Int -> Int -> V.Vector Int
ctest n i = V.generate i (+ (n-i+1))

prod' :: V.Vector Int -> Int
prod' = V.foldl' (\ac x -> ac * x `mod` mdl) 1

prodInv' :: V.Vector Int -> Int
prodInv' = V.foldl' (\ac x -> ac * (modInv x) `mod` mdl) 1



modInv :: Int -> Int
modInv a =  let (x,_,1) = eEA a mdl
            in  positivize x

eEA :: Int -> Int -> (Int, Int, Int)
eEA a 0 = (1, 0, a)
eEA a b =
    let (q, r) = a `quotRem` b
        (s, t, g) = eEA b r
    in  (t, s-q*t, g)

