#include <stdio.h>

const int Mod = 998244353;
long long fact[200001], fact_inv[200001];

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 combination(int n, int k)
{
	if (k < 0 || n < k) return 0;
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}

int main()
{
	int N, K;
	scanf("%d %d", &N, &K);
	if (K == 0 || K == N) {
		printf("1\n");
		fflush(stdout);
		return 0;
	} else if (K == 1) {
		if (N % 2 == 0) printf("2\n");
		else printf("%d\n", N - 2);
		fflush(stdout);
		return 0;
	}
	
	int i;
	long long ans = 0;
	for (i = 1, fact[0] = 1; i <= N; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = N - 1, fact_inv[N] = div_mod(1, fact[N], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;
	for (i = 0; i <= N - K; i += 2) ans += combination(N - i - 2, K - 2) * (i + 1) % Mod;
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}