#include <stdio.h>

const int Mod = 100000000;

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long pow_mod(int n, long long k)
{
	long long N, ans = 1;
	for (N = n; k > 0; k >>= 1, N = N * N % Mod) if (k & 1) ans = ans * N % Mod;
	return ans;
}

int main()
{
	int N, M;
	scanf("%d", &M);
	scanf("%d", &N);
	if (M < N) {
		printf("00000000\n");
		fflush(stdout);
		return 0;
	}
	
	int i, k, num2[2] = {}, num5[2] = {};
	long long rest[2] = {1, 1};
	for (i = M; i > M - N; i--) {
		k = i;
		while (k % 2 == 0) {
			k /= 2;
			num2[0]++;
		}
		while (k % 5 == 0) {
			k /= 5;
			num5[0]++;
		}
		rest[0] = rest[0] * k % Mod;
	}
	for (i = 2; i <= N; i++) {
		k = i;
		while (k % 2 == 0) {
			k /= 2;
			num2[1]++;
		}
		while (k % 5 == 0) {
			k /= 5;
			num5[1]++;
		}
		rest[1] = rest[1] * k % Mod;
	}
	
	long long ans = div_mod(rest[0], rest[1], Mod) * pow_mod(2, num2[0] - num2[1]) % Mod * pow_mod(5, num5[0] - num5[1]) % Mod;
	printf("%08lld\n", ans);
	fflush(stdout);
	return 0;
}