#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;

const int N = 1E7 + 5;

using mint = static_modint<100000000>;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int m, n; cin >> m >> n;
    mint num = 1, den = 1;
    mint ans;
    int p2 = 0, p5 = 0;
    if (n > m) {
        ans = 0;
    } else {
        for (int i = 1; i <= n; i++) {
            {
                int x = i;
                while (x % 2 == 0) {
                    p2--; x /= 2;
                }
                while (x % 5 == 0) {
                    p5--; x /= 5;
                }
                den *= x;
            }
            {
                int x = m - i + 1;
                while (x % 2 == 0) {
                    p2++; x /= 2;
                }
                while (x % 5 == 0) {
                    p5++; x /= 5;
                }
                num *= x;
            }
        }
        ans = num / den * mint(2).pow(p2) * mint(5).pow(p5);
    }
    cout << setfill('0') << setw(8) << ans.val();
}