mod = 10 ** 9 + 7


def mat_mul(A, B):
    res = [[0] * len(B[0]) for _ in range(len(A))]
    for i in range(len(A)):
        for k in range(len(A[0])):
            for j in range(len(B[0])):
                res[i][j] += A[i][k] * B[k][j]
                res[i][j] %= mod - 1
    return res


def mat_pow(A, n):
    size = len(A)
    res = [[0] * size for _ in range(size)]
    for i in range(size):
        res[i][i] = 1
    while n:
        if n & 1:
            res = mat_mul(res, A)
        A = mat_mul(A, A)
        n >>= 1
    return res


a, b, c = map(int, input().split())
k = int(input())

M = [[0, 1, 1], [1, 0, 1], [1, 1, 0]]
M = mat_pow(M, k)

ans = 1
for i in range(3):
    na = M[0][i]
    nb = M[1][i]
    nc = M[2][i]
    ans *= pow(a, na, mod)
    ans *= pow(b, nb, mod)
    ans *= pow(c, nc, mod)
    ans %= mod
print(ans)