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

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;
const int MOD7 = ( int ) 1e9 + 7;

ll A, B, C;

void init(){
  scanf( "%lld^%lld^%lld", &A, &B, &C );
}

ll ll_pow( ll v, ll p, ll mod ){
  v %= mod;
  ll res = 1LL;
  while( p ){
    if( p & 1LL )
      ( res *= v ) %= mod;
    p >>= 1;
    ( v *= v ) %= mod;
  }
  return res;
}

void preprocess(){
  
}

void solve(){
  cout << ll_pow( ll_pow( A, B, MOD7 ), C, MOD7 ) << " " << ll_pow( A, ll_pow( B, C, MOD7 ), MOD7 ) << endl;
}

signed main(){
  // ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}