#include #include #include #define LOG(FMT...) fprintf(stderr, FMT) typedef long long LL; const int N = 10000005, PC = 664600; const int mod = 100000000; int pr[PC], cnt; bool ws[N]; void sieve() { for (int i = 2; i < N; ++i) { if (!ws[i]) { pr[cnt++] = i; } for (int j = 0; i * pr[j] < N; ++j) { ws[i * pr[j]] = true; if (i % pr[j] == 0) { break; } } } } int p; int calc(int x) { int k = 0; while (x) { k += x /= p; } return k; } int main() { sieve(); int n, m; scanf("%d%d", &n, &m); if (n < m) { printf("%08d\n", 0); return 0; } int r = 1; for (int i = 0; i < cnt; ++i) { p = pr[i]; int k = calc(n) - calc(m) - calc(n - m); while (k) { if (k & 1) r = p * (LL)r % mod; p = p * (LL)p % mod; k >>= 1; } } printf("%08d\n", r); return 0; }