#include using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; template using minheap = priority_queue, greater>; template using maxheap = priority_queue; template bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template int flg(T x, int i) { return (x >> i) & 1; } template void print(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template void printn(const vector &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template int lb(const vector &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template int ub(const vector &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template void rearrange(vector &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template vector id_sort(const vector &v, bool greater = false) { int n = v.size(); vector ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template pair operator+(const pair &p, const pair &q) { return make_pair(p.first + q.first, p.second + q.second); } template pair operator-(const pair &p, const pair &q) { return make_pair(p.first - q.first, p.second - q.second); } template istream &operator>>(istream &is, pair &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template ostream &operator<<(ostream &os, const pair &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; // const int MOD = 1000000007; const int MOD = 998244353; const ll P = 100000000; struct Random_Number_Generator { mt19937_64 mt; Random_Number_Generator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {} // [l,r) での一様乱数 int64_t operator()(int64_t l, int64_t r) { uniform_int_distribution dist(l, r - 1); return dist(mt); } // [0,r) での一様乱数 int64_t operator()(int64_t r) { return (*this)(0, r); } } rng; long long modpow(long long x, long long n, const int &m) { x %= m; long long ret = 1; for (; n > 0; n >>= 1, x *= x, x %= m) { if (n & 1) ret *= x, ret %= m; } return ret; } template T modinv(T a, const T &m) { T b = m, u = 1, v = 0; while (b > 0) { T t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return u >= 0 ? u % m : (m - (-u) % m) % m; } // オイラーの φ 関数 (x と m が互いに素ならば、x^φ(m) ≡ 1 (mod m)) template T Euler_totient(T m) { T ret = m; for (T i = 2; i * i <= m; i++) { if (m % i == 0) ret /= i, ret *= i - 1; while (m % i == 0) m /= i; } if (m > 1) ret /= m, ret *= m - 1; return ret; } // x^k ≡ y (mod m) となる最小の非負整数 k (存在しなければ -1) int modlog(int x, int y, int m, int max_ans = -1) { if (max_ans == -1) max_ans = m; long long g = 1; for (int i = m; i > 0; i >>= 1) g *= x, g %= m; g = gcd(g, m); int c = 0; long long t = 1; for (; t % g != 0; c++) { if (t == y) return c; t *= x, t %= m; } if (y % g != 0) return -1; t /= g, y /= g, m /= g; int n = 0; long long gs = 1; for (; n * n < max_ans; n++) gs *= x, gs %= m; unordered_map mp; long long e = y; for (int i = 0; i < n; mp[e] = ++i) e *= x, e %= m; e = t; for (int i = 0; i < n; i++) { e *= gs, e %= m; if (mp.count(e)) return c + n * (i + 1) - mp[e]; } return -1; } // x^k ≡ 1 (mod m) となる最小の正整数 k (x と m は互いに素) template T order(T x, const T &m) { T n = Euler_totient(m); vector ds; for (T i = 1; i * i <= n; i++) { if (n % i == 0) ds.push_back(i), ds.push_back(n / i); } sort(begin(ds), end(ds)); for (auto &e : ds) { if (modpow(x, e, m) == 1) return e; } return -1; } // 素数 p の原始根 template T primitive_root(const T &p) { vector ds; for (T i = 1; i * i <= p - 1; i++) { if ((p - 1) % i == 0) ds.push_back(i), ds.push_back((p - 1) / i); } sort(begin(ds), end(ds)); while (true) { T r = rng(1, p); for (auto &e : ds) { if (e == p - 1) return r; if (modpow(r, e, p) == 1) break; } } } int main() { int M, N; cin >> M >> N; if (M < N) { cout << "00000000\n"; return 0; } int cnt = 0; int pw2 = 0, pw5 = 0; ll x = 1, y = 1; rep2(i, M - N + 1, M + 1) { int tmp = i; while (tmp % 2 == 0) { tmp /= 2; pw2++; } while (tmp % 5 == 0) { tmp /= 5; pw5++; } x *= tmp; x %= P; } rep2(i, 1, N + 1) { int tmp = i; while (tmp % 2 == 0) { tmp /= 2; pw2--; } while (tmp % 5 == 0) { tmp /= 5; pw5--; } y *= tmp; y %= P; } ll ans = x; rep(i, pw2) ans *= 2, ans %= P; rep(i, pw5) ans *= 5, ans %= P; ans *= modinv(y, P); ans %= P; string S = to_string(ans); while (sz(S) < 8) S = "0" + S; cout << S << '\n'; }