S=input()
P=int(input())
I=int(input())

assert(len(S)==4)
for i in range(4):
  assert('0'<=S[i])
  assert(S[i]<='9')
assert(0<=P)
assert(P<=(10**18))
assert(0<=I)
assert(I<=(10**18))

N=int(S)

mod=10**9+7
def m(a,b):
  r=[[0]*len(b[0]) for i in range(len(a))]
  for i in range(len(a)):
    for k in range(len(b)):
      for j in range(len(b[0])):
        r[i][j]=(r[i][j]+a[i][k]*b[k][j])%mod
  return r

def p(a,n):
  r=[[0]*len(a) for i in range(len(a))]
  b=[]
  for i in range(len(a)):
    r[i][i]=1
    b.append(a[i][:])
  l=n
  while l>0:
    if l&1:
      r=m(b,r)
    b=m(b,b)
    l>>=1
  return r

def f(n):
  global mod
  if n==0:
    return 0
  mod=10000
  A=[[n,1],[1,0]]
  A=p(A,P)
  if P&1:
    A[0][1]-=1
  return A[0][1]%mod

T=[[0]*10000 for i in range(62)]
T[0]=[f(i) for i in range(10000)]
for i in range(61):
  for j in range(10000):
    T[i+1][j]=T[i][T[i][j]]
for i in range(62):
  if (I>>i)&1:
    N=T[i][N]

print(str(N).zfill(4))