#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

const ll MOD = 1e9 + 7;

template <typename T>
T expt(T a, T n, T mod = std::numeric_limits<T>::max()){
    T res = 1ll;
    while(n){
        if(n & 1ll){res = res * a % mod;}
        a = a * a % mod;
        n >>= 1ll;
    }
    return res;
}

int main(){
    //*
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    /*/
      /*/
    
    ll A, B, C;
    scanf("%lld%*c%lld%*c%lld", &A, &B, &C);

    if(A % MOD == 0){
        puts("0 0");
        return 0;
    }
    
    // (A^B)^C
    ll res = expt(A % MOD, B % (MOD-1) * (C % (MOD-1)) % (MOD-1), MOD),
        res2 = expt(A % MOD, expt(B % (MOD - 1), C, MOD - 1), MOD);
    
    printf("%lld %lld\n", res, res2);
}