#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

struct Eratosthenes{
  vector<bool> isprime;
  vector<int> minfactor;
  vector<int> mobius;
  vector<int> mu;

  Eratosthenes(int N) : isprime(N+1,true),
                        minfactor(N+1,-1),
                        mobius(N+1,1),
                        mu(N+1,-1){
    isprime[1]=false;
    minfactor[1]=1;
    mu[1]=0;

    for(int p=2;p<=N;++p){
      if(!isprime[p]) continue;

      minfactor[p]=p;
      mobius[p]=-1;

      for(int q=p*2;q<=N;q+=p){
        isprime[q]=false;

        if(minfactor[q]==-1) minfactor[q]=p;
        if((q/p)%p==0) mobius[q]=0;
        else mobius[q]=-mobius[q];
      }
      for(int i=p;i<=N;i+=p) mu[i]=-mu[i];
      for(ll i=(ll)p*p;i<=N;i+=(ll)p*p) mu[i]=0;
    }
  }
};

ll nCr(ll n,ll r,ll mod,vector<int> &primes){
  if(n<0 || r<0 || r>n) return 0;
  if(r>n/2) r=n-r;
  vector<ll> A(n);
  rep(i,r) A[i]=n-i;
  
  for(auto p:primes){
    if(p>r) break;
    for(ll q=p;q<=r;q*=p){
      ll m=n%q;
      for(int i=m,j=0;j<r/q;i+=q,j++) A[i]/=p;
    }
  }
  
  ll mul=1;
  rep(i,r) mul=mul*A[i]%mod;
  return mul;
}
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  Eratosthenes er(10000000);
  vector<int> prime;
  for(int i=1;i<10000000;i++){
    if(er.isprime[i]) prime.push_back(i);
  }
  int m,n;
  cin>>m>>n;
  if(n>m) printf("00000000\n");
  else{
    printf("%08d\n",nCr(m,n,100000000,prime));
  }

  return 0;
}