a,b,c,d,e,N=map(int, input().split())

mod=10**9+7
if N==0:
  print(a%mod)
  exit()
if N==1:
  print((a+b)%mod)
  exit()
if N==2:
  ans=a+b+c*b+a*d+e
  print(ans%mod)
  exit()
  
def matmul(A, B):
    Ah, Bh, Bw = len(A), len(B), len(B[0])
    C = [[0 for _ in range(Bw)] for _ in range(Ah)]
    for i in range(Ah):
        for j in range(Bw):
            for k in range(Bh):
                C[i][j] += A[i][k] * B[k][j] % mod
                C[i][j] %= mod
    return C

# Mのk乗を効率的に計算する
def doubling(M, k):
    k -= 1
    Mc = M.copy()
    while k > 0:
        if k & 1 == 1:
            Mc = matmul(Mc, M)
        M = matmul(M, M) # Mの(2のi乗)の乗 を計算する
        k >>= 1
    return Mc 
 
M = [[c+1,-c+d,-d,e], [1,0,0,0],[0,1,0,0],[0,0,0,1]]
F = [[a+b], [a],[0],[1]]
Mn = doubling(M, N-1)
G = matmul(Mn, F)
print(G[0][0])