#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define pr(str) cout<<(str)<<endl
#define prpr(str) cout<<str<<endl
#define db(str) cerr<<(str)<<endl
#define dbdb(str) cerr<<str<<endl
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
#define spr(a) setprecision(a)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;

template<class InputIterator>
void dump(InputIterator first,InputIterator last,char delim=' '){
	for(InputIterator it=first;it!=last;it++){
		if(it!=first)cout<<delim;
		cout<<*it;
	}
}


ll p(ll x,ll y){
	if(y==0) return 1;
	ll A=p(x,y/2)%MOD;
	return (y&1?((A*A)%MOD*x)%MOD: (A*A)%MOD);
	// return (y&1?((A*A)*x):(A*A));
}

int main(void){
	ll a,b,c;
	scanf("%lld^%lld^%lld",&a,&b,&c);
	a%=MOD;
	b%=MOD;
	c%=MOD;
	cout<<p(p(a,b),c)<<" "<<p(a,p(b,c))<<endl;
}
/*
int main(void){
	string s;
	cin>>s;
	int c=0;
	sort(s.begin(),s.end());
	do{
		int x=0;
		for(int i=2;i<s.size();i++){
			if(s[i-2]!='0'&&s[i-1]==s[i]&&s[i-1]!=s[i-2]){
				x+=(s[i-2]-'0')*100+(s[i-1]-'0')*10+(s[i]-'0');
				i+=2;
			}
		}
		dump(s.begin(),s.end());
		cout<<endl;
		cout<<x<<endl;
		c=max(x,c);
	}while(next_permutation(s.begin(),s.end()));
	cout<<c<<endl;
	return 0;
}*/