using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static string InputPattern = "InputX";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("2^2^2");
            //16 16
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("2^3^2");
            //64 512
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("10^10^10");
            //226732710 206165314
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    const long Hou = 1000000007;

    static void Main()
    {
        List<string> InputList = GetInputList();
        long[] wkArr = InputList[0].Split('^').Select(pX => long.Parse(pX)).ToArray();
        long A = wkArr[0];
        long B = wkArr[1];
        long C = wkArr[2];

        long Answer1 = 0;
        if (A % Hou > 0) {
            Answer1 = DeriveBekijyou(A, B, Hou);
            Answer1 = DeriveBekijyou(Answer1, C, Hou);
        }

        long Answer2 = 0;
        if (A % Hou > 0) {
            long ModPow = DeriveBekijyou(B, C, Hou - 1);
            Answer2 = DeriveBekijyou(A, ModPow, Hou);
        }

        Console.WriteLine("{0} {1}", Answer1, Answer2);
    }

    // 繰り返し2乗法で、(NのP乗) Mod Mを求める
    static long DeriveBekijyou(long pN, long pP, long pM)
    {
        long CurrJyousuu = pN % pM;
        long CurrShisuu = 1;
        long WillReturn = 1;

        while (true) {
            // 対象ビットが立っている場合
            if ((pP & CurrShisuu) > 0) {
                WillReturn = (WillReturn * CurrJyousuu) % pM;
            }

            CurrShisuu *= 2;
            if (CurrShisuu > pP) return WillReturn;
            CurrJyousuu = (CurrJyousuu * CurrJyousuu) % pM;
        }
    }
}