#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;

long long modpow(long long x, long long n,int MOD) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret = (ret * x) % MOD;  
        x = (x * x) % MOD;
        n >>= 1;  
    }
    return ret;
}


int main(){
    string s;
    cin >> s;
    vector<ll> a;
    ll now = 0;
    ll c = 1;
    for(int i=s.size()-1;i>=0;i--){
        if(s[i] < '0' || '9' < s[i]){
            a.push_back(now);
            now = 0;
            c = 1;
        }else{
            now = now + (s[i] - '0') * c;
            c *= 10;
        }
    }  
    a.push_back(now);
    reverse(a.begin(),a.end());

    ll ans1,ans2;
    ans1 = modpow( modpow(a[0]%MOD,a[1],MOD),a[2],MOD);
    ans2 = modpow(a[0]%MOD,modpow(a[1]%(MOD-1),a[2],MOD-1),MOD);
    cout << ans1 <<" " << ans2 << endl;
    return 0;
}