#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const ll MOD = 100000000;

ll mod_pow(ll a, ll n, ll mod=MOD) {
    ll ans = 1;
    while (n > 0) {
        if (n&1) ans = (ans*a)%mod;
        a = (a*a)% mod;
        n >>= 1;
    }
    return ans;
}

ll inv_mod(ll a){
    return mod_pow(a, 40000000-1, MOD);
}

int count_divs(int n, int p){
    int ans = 0;
    ll q = p;
    while(q <= n){
        ans += n/q;
        q *= p;
    }
    return ans;
}

ll prod(ll x, ll y){
    return (x*y)%MOD;
}

ll fac(int n){
    ll ans = 1;
    for(int x = 1; x <= n; x++){
        int y = x;
        while(y%2 == 0) y /= 2;
        while(y%5 == 0) y /= 5;
        ans = prod(ans, y);
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int m, n; cin >> m >> n;
    ll ans = prod(prod(fac(m), inv_mod(fac(n))), inv_mod(fac(m-n)));
    int cnt2 = count_divs(m, 2) - count_divs(n, 2) - count_divs(m-n, 2);
    ans = prod(ans, mod_pow(2, cnt2));
    int cnt5 = count_divs(m, 5) - count_divs(n, 5) - count_divs(m-n, 5);
    ans = prod(ans, mod_pow(5, cnt5));
    string s = to_string(ans);
    while(s.size() < 8) s = "0"+s;
    cout << s << endl;
}