import Data.List

main = do
  [a,b,c] <- map read . words . map hat2sp <$> getLine
  let ans = solve a b c
  putStrLn $ unwords $ map show ans

solve :: Int -> Int -> Int -> [Int]
solve a b c = [powerish mul 1 ab c, powerish mul 1 a bc]
  where
    ab = powerish mul 1 a b
    bc = powerish mul1 1 b c
    mul1 x y = mod (x * y) (pred modBase)

hat2sp '^' = ' '
hat2sp c   = c

modBase = 1_000_000_007

reg x = mod x modBase
mul x y = reg $ x * y

-- @gotoki_no_joe
powerish mul i a b = foldl' {-'-} mul i [p | (True, p) <- zip bs ps]
  where
    bs = map odd $ takeWhile (0 <) $ iterate (flip div 2) b
    ps = iterate (\x -> mul x x) a