/* -*- coding: utf-8 -*-
 *
 * 403.cc: No.403 2^2^2 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

typedef long long ll;
const ll MOD = 1000000007;

/* typedef */

/* global variables */

/* subroutines */

ll readnum(string &s, int &pos) {
  while (pos < s.size() && (s[pos] < '0' || s[pos] > '9')) pos++;
  ll num = 0;
  while (pos < s.size() && s[pos] >= '0' && s[pos] <= '9')
    num = num * 10 + s[pos++] - '0';
  return num;
}

ll powmod(ll a, ll n, ll mod) {  // a^n % mod
  if (a == 0) return 0;
  ll pm = 1;
  while (n > 0) {
    if (n & 1) pm = (pm * a) % mod;
    a = (a * a) % mod;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  string s;
  cin >> s;

  int pos = 0;
  ll a = readnum(s, pos);
  pos++; // '^'
  ll b = readnum(s, pos);
  pos++; // '^'
  ll c = readnum(s, pos);
  //printf("%lld^%lld^%lld\n", a, b, c);

  a %= MOD;
  
  // x = (a^b)^c
  ll ab = powmod(a, b, MOD);
  ll x = powmod(ab, c, MOD);
  //printf("(a^b)^c=%lld^%lld=%lld\n", ab, c, x);
  
  // y = a^(b^c)
  ll bc = powmod(b % (MOD - 1), c, MOD - 1);
  ll y = powmod(a, bc, MOD);
  //printf("a^(b^c)=%lld^%lld=%lld\n", a, bc, y);

  printf("%lld %lld\n", x, y);
  return 0;
}