#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int int64_t //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}

int beki(int a,int n,int mod = MOD)
{
    a %= mod;
    //n %= mod-1;
  int ret = 1;
  while(n){
    if(n % 2)ret = (ret * a) % mod;
    a = (a * a) % mod;
    n /= 2;
  }
  return ret;
}

signed main(void) {
    string s;
    cin >> s;
    vi in;
    int t = 0;
    rep(i,s.size()){
        if(s[i] == '^'){
            in.push_back(t);
            t = 0;
        }else{
            t *= 10;
            t += s[i]-'0';
        }
    }
    in.push_back(t);
    if(in[0]%MOD == 0)cout << "0 0" << endl;
    else cout << beki(beki(in[0],in[1]),in[2]) << " " << beki(in[0],beki(in[1],in[2],MOD-1)) << endl;
}