package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

const MaxInt = math.MaxInt64

var scanner *bufio.Scanner

const M = 1_000_000_000 + 7

// a^p%m
func powmod(a, p, m int) int {
	ret := 1
	for p > 0 {
		if p%2 == 1 {
			ret = (ret * a) % m
		}
		a = (a * a) % m
		p /= 2
	}
	return ret
}

func main() {
	a, b, c := Int(), Int(), Int()
	k := Int()
	x := (((a * b) % M) * c) % M
	r := powmod(2, k, M-1)
	ans := powmod(x, r, M)
	fmt.Println(ans)
}

func init() {
	scanner = bufio.NewScanner(os.Stdin)
	scanner.Buffer([]byte{}, MaxInt)
	scanner.Split(bufio.ScanWords)
}

func Int() int {
	scanner.Scan()
	ret, _ := strconv.ParseInt(scanner.Text(), 10, 0)
	return int(ret)
}

func Ints(n int) []int {
	ret := make([]int, n)
	for i := 0; i < n; i++ {
		ret[i] = Int()
	}
	return ret
}

func Max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func Min(a, b int) int {
	if a < b {
		return a
	}
	return b
}