/* -*- coding: utf-8 -*-
 *
 * 1578.cc:  No.1578 A × B × C - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MOD = 1000000007;

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

int powmod(int a, ll n, int mod) {  // a^n % mod
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % mod;
    a = (ll)a * a % mod;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  int a, b, c;
  ll k;
  scanf("%d%d%d%lld", &a, &b, &c, &k);

  // 0: a, b, c -> abc
  // 1: bc, ca, ab -> (abc)^2
  // 2: a^2bc, ab^2c, abc^2 -> (abc)^4
  // 3: a^2b^3c^3, a^3b^2c^3, a^3b^3c^2 -> (abc)^8
  // k: -> (abc)^(2^k)

  int e = powmod(2, k, MOD - 1);
  int d = (ll)a * b % MOD * c % MOD;
  int f = powmod(d, e, MOD);

  printf("%d\n", f);
  return 0;
}