import Data.List main :: IO () main = do abc <- map read . words . map hat2sp <$> getLine let ans = solve abc putStrLn $ unwords $ map show ans solve :: [Int] -> [Int] solve [a,b,c] = [powerish mul 1 ab (reg1 c), powerish mul 1 (reg a) bc] where ab = powerish mul 1 (reg a) (reg1 b) bc = powerish mul1 1 (reg1 b) c mul1 x y = reg1 $ x * y reg1 x = mod x (pred modBase) -- reg2 x = mod x (modBase - 2) hat2sp :: Char -> Char hat2sp '^' = ' ' hat2sp c = c modBase = 1_000_000_007 reg x = mod x modBase mul x y = reg $ x * y -- @gotoki_no_joe powerish _ _ 0 _ = 0 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