#include #define ll long long #define INF 1000000005 #define EPS 1e-10 #define rep(i,n) for(int i=0;i<(int)(n);++i) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i) #define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i) #define each(a,b) for(auto (a): (b)) #define all(v) (v).begin(),(v).end() #define len(v) (int)(v).size() #define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end()) #define fi first #define se second #define pb push_back #define show(x) cout<<#x<<" = "<<(x)< P; typedef vector vi; typedef vector vvi; typedef vector vl; typedef vector vd; typedef vector

vp; const int MAX_N = 100005; ll MOD; ll mod_pow(ll a,ll b) { a %= MOD; ll res = 1; while(b){ if(b & 1){ res = res * a % MOD; } a = a * a %MOD; b >>= 1; } return res; } ll add(ll x,ll y) { return (x + y)%MOD; } ll sub(ll x,ll y) { return (x+MOD-y)%MOD; } ll mult(ll x,ll y) { return x*y%MOD; } ll trans(string s) { ll tm = 1; ll res = 0; rrep(i,len(s)){ res += tm*(s[i]-'0'); tm *= 10; } return res; } int main() { cin.tie(0); ios::sync_with_stdio(false); ll a,b,c; string s; cin >> s; s.pb('^'); int st = 0; int cnt = 0; rep(i,len(s)){ if(s[i] == '^'){ if(cnt == 0){ a = trans(s.substr(st,i-st)); st = i+1; cnt++; }else if(cnt == 1){ b = trans(s.substr(st,i-st)); st = i+1; cnt++; }else{ c = trans(s.substr(st,i-st)); } } } MOD = 1000000007LL; ll res = mod_pow(a%MOD,b); cout << mod_pow(res,c) << " "; if(a % MOD == 0){ cout << "0\n"; }else{ MOD--; ll res = mod_pow(b%MOD,c); MOD++; cout << mod_pow(a%MOD,res) << endl; } return 0; }