#!/usr/bin/python
mul = lambda x, y: x*y
def nCr(n, r):
    if r == 0 or n == r:
        return 1
    k = r if r <= n-r else n-r
    return reduce(mul, xrange(n, n-k, -1)) / reduce(mul, xrange(1, k+1))

mod = int(1e9)
n = int(raw_input())
m = int(raw_input())
x = n / 1000
y = x % m
print nCr(m, y) % mod