#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = static_modint<100000000>;

} int main() {
  int m, n;
  cin >> m >> n;
  if (m < n) {
    cout << "00000000\n";
    return 0;
  }
  // comb(m, n) = (m)!/n!(m-n)!
  struct S {
    mint x;
    int c2, c5;
  };
  auto fact = [&](int n) -> S {
    S res{1, 0, 0};
    while(n > 0) {
      int t = n--;
      while(t % 2 == 0) {
        res.c2++;
        t /= 2;
      }
      while(t % 5 == 0) {
        res.c5++;
        t /= 5;
      }
      res.x *= t;
    }
    return res;
  };
  S a = fact(m), b = fact(n), c = fact(m-n);
  a.x /= b.x * c.x;
  a.c2 -= b.c2 + c.c2;
  a.c5 -= b.c5 + c.c5;
  a.x *= mint(2).pow(a.c2) * mint(5).pow(a.c5);
  printf("%08u\n", a.x.val());
}