#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k, ll m){
    ll ap=a, ans=1;
    while(k>0){
        if(k%2==1){
            ans*=ap;
            ans%=m;
        }
        ap=ap*ap;
        ap%=m;
        k/=2;
    }
    return ans;
}
int main()
{
	ll a, b, c;
	scanf("%lld^%lld^%lld", &a, &b, &c);
	a%=MOD;
	if(a==0){
		printf("%d %d\n", 0, 0);
		return 0;
	}
	ll ans1=powmod(a, b%(MOD-1), MOD);
	ans1=powmod(ans1, c%(MOD-1), MOD);
	ll ans2=powmod(b%(MOD-1), c, MOD-1);
	ans2=powmod(a, ans2, MOD);
	printf("%lld %lld\n", ans1, ans2);
	return 0;
}