{-# LANGUAGE NumericUnderscores #-}

import Control.Monad
import Control.Monad.Fix
import Data.Bool
import Data.IORef

modulo :: Int
modulo = 1_000_000_007
{-# INLINE modulo #-}

main :: IO ()
main = do
  [a, b, n] <- map read . words <$> getLine
  let c   = bool ((a + modulo) `div` 2) (a `div` 2)  (even a)
      det = (c * c `mod` modulo + b) `mod` modulo
  cache <- newIORef (c, 1)
  x     <- newIORef (1, 0)
  flip fix n $ \loop i -> do
    when (odd i) $ do
      ca <- readIORef cache
      modifyIORef' x (\i -> mul i ca det)
    modifyIORef' cache (\i -> mul i i det)
    when (i > 0) $ loop (i `div` 2)
  (_, q) <- readIORef x
  print q

mul :: (Int, Int) -> (Int, Int) -> Int -> (Int, Int)
mul (a, b) (c, d) det =
  let p = (a * c `mod` modulo + det * (b * d `mod` modulo) `mod` modulo) `mod` modulo
      q = (a * d `mod` modulo + b * c `mod` modulo) `mod` modulo
  in (p, q)