p, q, r, K = map(int, input().split())
A = [[0, 1, 0], [0, 0, 1], [1, 1, 1]]
K -= 1


def product(A, B, MOD):
    h = len(A)
    w = len(B[0])
    res = [[0]*w for _ in range(h)]
    for i in range(h):
        for j in range(w):
            for k in range(len(B)):
                res[i][j] += A[i][k]*B[k][j]
                res[i][j] %= MOD
    return res


M = K.bit_length()
B = [None]*M
B[0] = A
for i in range(1, M):
    B[i] = product(B[i-1], B[i-1], 10)
ans = [[p], [q], [r]]
for i in range(M):
    if (K >> i) & 1:
        ans = product(B[i], ans, 10)

print(ans[0][0])