# 行列の計算（numpyを使えないとき,modを使用）
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

mod=998244353

x,y,n=map(int,input().split())

POWA=[[[x,y,1,0],[-5*y,x,0,1],[0,0,1,0],[0,0,0,1]]]

for i in range(60):
    POWA.append(prod(POWA[-1],POWA[-1],4,4,4)) # ベキを求めて

X=[[x,y,0,0]]

while n:
    X=prod(X,POWA[n.bit_length()-1],1,4,4) # n乗の場合
    n-=1<<(n.bit_length()-1)

print(X[0][2],X[0][3])