def matrix_prod(A, B, mod = 998244353):
  l, m, n = len(A), len(B), len(B[0])
  C = [[0 for _ in range(n)] for _ in range(l)]
  for i in range(l):
    for j in range(m):
      a = A[i][j]
      for k in range(n):
        C[i][k] = (C[i][k] + a * B[j][k]) % mod
  return C

def matrix_pow(A, K, mod = 998244353):
  n = len(A)
  if K == 0:
    return [[int(i == j) for j in range(n)] for i in range(n)]
  D = K.bit_length()
  res = [[A[i][j] for j in range(n)] for i in range(n)]
  for d in range(D - 2, -1, -1):
    res = matrix_prod(res, res, mod)
    if (K >> d) & 1:
      res = matrix_prod(A, res, mod)
  return res

mod = 998244353
x, y, N = map(int, input().split())
b = [[x], [y], [x], [y]]
A = [[x, -5 * y, 0, 0], [y, x, 0, 0], [x, -5 * y, 1, 0], [y, x, 0, 1]]
b = matrix_prod(matrix_pow(A, N - 1), b)
print(b[2][0] % mod, b[3][0] % mod)