MOD = 10 ** 9

n = int(input())
m = int(input())

n //= 1000
n %= m

ret = 1
inv = 1
two = 0
five = 0
for i in range(m, m - n, -1):
    while i % 2 == 0:
        i //= 2
        two += 1
    while i % 5 == 0:
        i //= 5
        five += 1
    ret *= i
    ret %= MOD

for i in range(1, n + 1):
    while i % 2 == 0:
        i //= 2
        two -= 1
    while i % 5 == 0:
        i //= 5
        five -= 1
    inv *= i
    inv %= MOD

def modinv(a, MOD):
    b = MOD
    u = 1
    v = 0
    while b:
        t = a // b
        a -= t * b
        u -= t * v
        a, b = b, a
        u, v = v, u
    u %= MOD
    return u

ret *= modinv(inv, MOD)
ret %= MOD
ret *= pow(2, two, MOD) * pow(5, five, MOD)
ret %= MOD
print(ret)