#include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)< pii; typedef vector vi; typedef vector vll; template class ModInt{ public: ModInt():value(0){} ModInt(long long val):value((int)(val<0?MOD+val%MOD:val%MOD)){ } ModInt& operator+=(ModInt that){ value = value+that.value; if(value>=MOD)value-=MOD; return *this; } ModInt& operator-=(ModInt that){ value -= that.value; if(value<0)value+=MOD; return *this; } ModInt& operator*=(ModInt that){ value = (int)((long long)value * that.value % MOD); return *this; } ModInt &operator/=(ModInt that){ return *this *= that.inverse(); } ModInt operator+(ModInt that) const{ return ModInt(*this)+=that; } ModInt operator-(ModInt that) const{ return ModInt(*this)-=that; } ModInt operator*(ModInt that) const{ return ModInt(*this)*=that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt operator^(long long k) const{ ModInt n = *this, res = 1; while(k){ if(k & 1)res *= n; n *= n; k >>= 1; } return res; } ModInt inverse() const { long long a = value, b = MOD, u = 1, v = 0; while(b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return ModInt(u); } int toi() const{ return value; } private: int value; }; typedef ModInt<1000000007> mint; typedef ModInt<1000000006> mint2; ostream& operator<<(ostream& os, const mint& x){ os << x.toi(); return os; } const int P = 1000000007; int main(){ ll a, b, c; scanf("%lld^%lld^%lld", &a, &b, &c); { mint ans = a; ans = ans^b; ans = ans^c; cout << ans << ' '; } { mint ans = a; mint2 x = b; x = x^c; if(x.toi()) ans = ans ^ (x.toi()); else ans = 1; cout << ans << endl; } }