#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define DREP(i,s,n) for(int i = (s); i < (n); i++)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using ll = long long;
using P = pair<int,int>;
using Pl = pair<long long,long long>;
using veci = vector<int>;
using vecl = vector<long long>;
using vecveci = vector<vector<int>>;
using vecvecl = vector<vector<long long>>;
const int MOD = 1000000007;
const double pi = acos(-1);
ll gcd(ll a, ll b) {if(b == 0) return a; else return gcd(b,a%b);}
ll lcm(ll a, ll b) {return a*b/gcd(a,b);}

ll mod_pow(ll a, ll n, ll m) {
    if (n == 0) return 1;
    auto t = mod_pow(a, n / 2, m);
    t = t * t;
    t %= m;
    if (n & 1) {
        t = t * a;
        t %= m;
    }
    return t;
}

int main() {
    ll A,B,C;
    ll K; cin >> A >> B >> C >> K;
    ll ans = 1;
    ans *= A*B;
    ans %= MOD;
    ans *= C;
    ans %= MOD;
    cout << mod_pow(ans,mod_pow(2LL,K,MOD-1),MOD) << endl;
    return 0;
}