#include <bits/stdc++.h>
using namespace std;

#define rep(i, j, n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define INF 1e9
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcm(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};

i64 power(i64 x, i64 n, i64 mod) {
  i64 ret = 1;
  while(n > 0) {
    if(n & 1) (ret *= x) %= mod;
    (x *= x) %= mod;
    n >>= 1;
  }
  return ret;
}

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

  string s;
  cin >> s;

  int p = 0;
  i64 a, b, c;
  {
    string t;
    for(; s[p] != '^'; ++p) t += s[p];
    a = stoll(t);
    p++;
    a %= mod;
  }
  {
    string t;
    for(; s[p] != '^'; ++p) t += s[p];
    b = stoll(t);
    p++;
  }
  {
    string t;
    for(; p < s.size(); ++p) t += s[p];
    c = stoll(t);
  }

  {
    i64 ret = power(a, b, mod);
    i64 res = power(ret, c, mod);
    cout << res << " ";
  }
  {
    i64 ret = power(b, c, mod - 1);
    i64 res = power(a, ret, mod);
    cout << res << endl;
  }
}