#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)

/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#define PII pair<int,int>
/////////
using namespace::std;

// 最大公約数
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////
const ULL mod = 1000000007;
ULL powMod(ULL X,ULL N,ULL Mod){//X**N
	X %= Mod;
	if( X == 0 ){return 0;}//0**N=0
	ULL ret = 1;
	ULL Xpow = X;
	while(N){
		if( N & 1){
			ret = (ret*Xpow)%Mod;
		}
		Xpow = (Xpow*Xpow)%Mod;
		N >>= 1;
	}
	return ret;
}

inline void solve(){
	ULL A,B,C;
	char de;
	cin >> A >>de >> B >>de >>C;
	A = A%mod;
	
	cout << powMod( powMod(A,B,mod), C ,mod ) << " "
	<< powMod( A, powMod(B,C,mod-1) ,mod ) << endl;
}

signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	//std::cout << std::fixed;//小数を10進数表示
	//cout << setprecision(16);//小数をいっぱい表示する。16?

	solve();
}