def C(n, r):
    return fact[n] // fact[r] // fact[n-r]

fact = [1]

for i in range(1, 1001):
    fact.append(fact[-1] * i)

N = int(input())
M = int(input())
MOD = 10 ** 9
i = 0

while True:
    if M * 1000 * (i + 1) > N:
        c = (N - M * 1000 * i) // 1000
        break
    i += 1

ans = C(M, c) % MOD
print(ans)