import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
mod = 10 ** 9 + 7
def mat_prod(A,B):
    C = [[0]*(len(B[0])) for _ in range(len(A))]
    for i,Ci in enumerate(C):
        for k,aik in enumerate(A[i]):
            for j,bkj in enumerate(B[k]):
                Ci[j] = (Ci[j]+aik*bkj)%mod
    return C

def mat_pow(A,p):
  if p%2:
    return mat_prod(A,mat_pow(A,p-1))
  elif p > 0:
    b = mat_pow(A,p//2)
    return mat_prod(b,b)
  else:
    return [[int(i == j) for j in range(len(A))] for i in range(len(A))]
  

a, b, c, d, e, n = na()
if n == 0:
   print(a)
elif n == 1:
   print(b)
else:
    A = [[1, c, d, e], [0, c, d, e], [0, 1, 0, 0], [0, 0, 0, 1]]

    F = mat_pow(A, n-1)
    x = ([a + b], [b], [a], [1])
    
    y = mat_prod(F, x)
    print(y[0][0] % mod)