#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
ll modpow(ll a,ll n, ll mod) {
  a%=mod;if(a==0)return 0;
  ll res = 1;
  while (n > 0) {
      if (n & 1) res = res * a % mod;
      a = a * a % mod;
      n >>= 1;
  }
  return res;
}
const ll base=1e7+10;
vl dp(base),two(base),five(base);
ll phi=1;
int main(){
  rep(i,9)phi*=2;
  rep(i,7)phi*=5;
  ll m,n;cin >> m >> n;
  if(m<n){
    cout << "00000000" << endl;return 0;
  }
  dp[0]=1;
  ll mod=1e8;
  repl(i,1,base){
    two[i]=two[i-1],five[i-1]=five[i-1];dp[i]=dp[i-1];
    ll f=i;
    while(f%2==0){
      f/=2;two[i]++;
    }
    while(f%5==0){
      f/=5;five[i]++;
    }
    dp[i]=(dp[i]*f)%mod;
  }
  ll ans=dp[m];
  ans=ans*modpow(dp[n],phi-1,mod)%mod;
  ans=ans*modpow(dp[m-n],phi-1,mod)%mod;
  rep(i,two[m]-two[n]-two[m-n]){
    ans=ans*2%mod;
  }
  rep(i,five[m]-five[n]-five[m-n]){
    ans=ans*5%mod;
  }
  string f=to_string(ans);
  while(f.size()<8)f="0"+f;
  cout << f << endl;

}