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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define ALL(x) (x).begin(), (x).end()
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
#define fst first
#define snd second
typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> pii;typedef vector<pii> vpii;
typedef long long ll;

const long long mod = 1000000007;

long long powMod(long long x, long long y) {
  long long r = 1, a = x % mod;
  while (y) {
    if (y & 1) r = (r * a) % mod;
    a = a * a % mod;
    y /= 2;
  }
  return r;
}

long long powMod2(long long x, long long y, const long long M) {
  long long r = 1, a = x % M;
  while (y) {
    if (y & 1) r = (r * a) % M;
    a = a * a % M;
    y /= 2;
  }
  return r;
}

void Main() {
  ll A, B, C;
  scanf("%lld^%lld^%lld", &A, &B, &C);

  int ans1 = powMod(powMod(A, B), C);
  int ans2 = powMod(A, powMod2(B, C, mod-1));

  _p("%d %d\n", ans1, ans2);
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }