#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int A,B,C;
string s;

vector<string> split(const string &s, char delim) {
    vector<string> elems;
    string item;
    for (char ch: s) {
        if (ch == delim) {
            if (item.size()) elems.push_back(item);
            item.clear();
        }
        else {
            item += ch;
        }
    }
    if (item.size()) elems.push_back(item);
    return elems;
}

int MOD = 1e9+7;
int mod_pow(int b, int e, int m) {
    int result = 1;
    b %= m;
    while (e > 0) {
        if ((e & 1) == 1) result = (result * b) % m;
        e >>= 1;
        b = (b * b) % m;
    }
    
    return result;
}

void solve() {
    cin>>s;
    auto list = split(s, '^');
    A = stoll(list[0]);
    B = stoll(list[1]);
    C = stoll(list[2]);
    
    cout << mod_pow(mod_pow(A, B, MOD), C, MOD) << " ";
    int p = mod_pow(B, C, MOD-1);
    if (!p) p = MOD-1;
    cout << mod_pow(A, p, MOD);
    cout << endl;
}