from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 10**4+7
INF = 1<<60
Yes, No = "Yes", "No"

K, S, N = map(int, input().split())
F = [1, 1]
for _ in range(K-1):
    F.append(F[-2]+F[-1])
PF = [pow(F[i], -1, MOD) for i in range(len(F))]

ans = [S]
for i in range(1, N):
    tmp = 0
    cur = 0
    j = i-1
    while j >= 0 and cur <= K:
        tmp += ans[j]*PF[cur]
        tmp %= MOD
        j -= 1
        cur += 1
    ans.append(tmp)
print(ans[N-1])