#include <bits/stdc++.h>

template<typename T> T in() { abort(); return T(); }
template<> std::string in() { std::string str; std::cin >> str; return str; }
template<> int in() { int x; scanf("%d", &x); return x; }

template<typename T> void out(T x) { abort(); }
template<> void out(std::string x) { std::cout << x << std::endl; }
template<> void out(int x) { printf("%d\n", x); }

template<typename T>
T pow(T x, long n) {
  T res = 1;
  T p = x;
  while( n != 0 ) {
    if( n & 0x01 ) res *= p;
    p *= p;
    n >>= 1;
  }
  return res;
}

template<long P = 1000000007>
class Mod {
public:
  Mod() : a(0) {}
  Mod(long x) : a(x % P) {}
  long get() { return a; }
  Mod operator + (Mod x) { return Mod<P>((a + x.get()) % P); }
  Mod operator += (Mod x) { a = (a + x.get()) % P; return *this; }
  Mod operator - (Mod x) { return Mod<P>((a + P - x.get()) % P); }
  Mod operator -= (Mod x) { a = (a + P - x.a) % P; return *this; }
  Mod operator * (Mod x) { return Mod<P>((a * x.get()) % P); }
  Mod operator *= (Mod x) { a = (a * x.a) % P; return *this; }
  Mod operator / (Mod x) { return *this * pow(x, P - 2); }
  Mod operator /= (Mod x) { a = (*this * pow(x, P - 2)); return *this; }
private:
  long a;
};


// (A ^ B) ^ C
void solve1(long a, long b, long c) {
  b %= 1000000007 - 1;
  c %= 1000000007 - 1;
  Mod<> res = a;
  res = pow(pow(Mod<>(a), b), c);
  printf("%ld ", res.get());
}

// A ^ (B ^ C)
void solve2(long a, long b, long c) {
  c %= 1000000007 - 1;
  auto t = pow(Mod<1000000006>(b), c);
  Mod<> res = pow(Mod<>(a), t.get());
  printf("%ld\n", res.get());
}


int main() {
  char buf[256];
  scanf("%s", buf);
  long a, b, c;
  sscanf(buf, "%ld^%ld^%ld", &a, &b, &c);
  solve1(a, b, c);
  solve2(a, b, c);
  
  
  return 0;
}