def extgcd(a, b):
    # ax + by = gcd(a,b)
    # return gcd(a,b), x, y
    if a == 0:
        return b, 0, 1
    else:
        g, x, y = extgcd(b % a, a)
        return g, y - (b // a) * x, x

def chineseRem(b1, m1, b2, m2):
    # x ≡ b1 (mod m1) ∧ x ≡ b2 (mod m2) <=> x ≡ r (mod m)
    # となる(r. m)を返す
    # 解無しのとき(0, -1)
    d, p, q = extgcd(m1, m2)
    if (b2 - b1) % d != 0:
        return 0, -1
    m = m1 * (m2 // d)  # m = lcm(m1, m2)
    tmp = (b2-b1) // d * p % (m2 // d)
    r = (b1 + m1 * tmp) % m
    return r, m

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

if m < n:
    print("{:08}".format(0))
    exit()
if m == n:
    print("{:08}".format(1))
    exit()


mtwo = 2**8
mfive = 5**8
x2,y2 = 1,0
x5,y5 = 1,0

base2 = 1
num2 = 0
base5 = 1
num5 = 0

for i in range(1,m+1):
    now = i
    while now%2 == 0:
        now //= 2
        y2 += 1
    x2 = x2*now % mtwo

    now = i
    while now%5 == 0:
        now //= 5
        y5 += 1
    x5 = x5*now % mfive

    if i == m:
        base2 *= x2
        num2 += y2
        base5 *= x5
        num5 += y5

    elif i == n or i == m-n:
        _,inv2,_ = extgcd(x2,mtwo)
        _,inv5,_ = extgcd(x5,mfive)
        base2 *= inv2
        num2 -= y2
        base5 *= inv5
        num5 -= y5

if num2 >= 8:
    base2 = 0
else:
    base2 *= pow(2,num2)
if num5 >= 8:
    base5 = 0
else:
    base5 *= pow(5,num5)
ans,_ = chineseRem(base2,mtwo,base5,mfive)
ans %= 10**8
print("{:08}".format(ans))