#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;

long long fac[200005], finv[200005], inv[200005];

void COMinit() {
    fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
    for (int i = 2; i < 200005; i++) {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

int main() {
    int N,K;
    cin >> N >> K;
    if(K == 0) {
        cout << 1 << endl;
    }
    else if(K == 1) {
        cout << N%2 << endl;
    }
    else {
        COMinit();
        long long ans = 0;
        for(int i = 0; i <= N-K; i += 2) {
            ans += COM(N-i-2,K-2)*(i+1)%mod;
            ans %= mod;
        }
        cout << ans << endl;
    }
}