using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var m = NN;
        var n = NN;
        if (m < n)
        {
            WriteLine("00000000");
            return;
        }
        var begin = DateTime.Now;
        if (n > m / 2) n = m - n;
        var mod = 100_000_000;
        var ans = 1L;
        var count2 = 0;
        var count5 = 0;
        var dic = new Dictionary<int, int>();
        for (var i = 0; i < n; ++i)
        {
            var ch = m - i;
            while (ch % 2 == 0)
            {
                ++count2;
                ch /= 2;
            }
            while (ch % 5 == 0)
            {
                ++count5;
                ch /= 5;
            }
            ans = ans * ch % mod;
            var pa = i + 1;
            while (pa % 2 == 0)
            {
                --count2;
                pa /= 2;
            }
            while (pa % 5 == 0)
            {
                --count5;
                pa /= 5;
            }
            if (dic.ContainsKey(pa)) ans = ans * dic[pa] % mod;
            else
            {
                var rev = (int)Exp(pa, mod - 2, mod);
                dic[pa] = rev;
                ans = ans * rev % mod;
            }
        }
        ans = ans * Exp(2, count2, mod) % mod * Exp(5, count5, mod) % mod;
        WriteLine(ans.ToString("00000000"));
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}