#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b)
{
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 2E+05;
struct edge {
    int to, cost, id;
};

ll di[4] = { 0, -1, 0, 1 }, dj[4] = { 1, 0, -1, 0 };

int N;

int X[MAX_N + 1];

ll modPow(ll x, ll a, ll mod)
{
    ll ans = 1;
    while (a > 0) {
        if (a & 1) {
            ans = (ans * x) % mod;
        }
        x = (x * x) % mod;
        a >>= 1;
    }
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string s;

    cin >> s;

    vector<string> sv;
    int last = 0;
    for (int i = 0; i < s.size(); ++i) {
        if (s[i] == '^') {
            sv.push_back(s.substr(last, i - last));
            last = i + 1;
        }
    }
    sv.push_back(s.substr(last, s.size() - last));
    ll a = stoll(sv[0]);
    ll b = stoll(sv[1]);
    ll c = stoll(sv[2]);

    ll ans0, ans1;
    if (a % MOD == 0) {
        ans0 = 0;
        ans1 = 0;
    } else {
        ans0 = modPow(modPow(a, b, MOD), c, MOD);
        ll r = modPow(b, c, MOD - 1);
        ans1 = modPow(a, r, MOD);
    }

    cout << ans0 << " " << ans1 << "\n";

    return 0;
}