#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<ll>;
using VV = vector<V>;
using VVV = vector<VV>;
using VVVV = vector<VVV>;
using VVVVV = vector<VVVV>;
using VVVVVV = vector<VVVVV>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<VB>;
using P = pair<ll,ll>;
using M = map<ll,ll>;
using Q = queue<ll>;
using PQ = priority_queue<ll>;
using PQG = priority_queue<ll,V,greater<ll>>;
using S = set<ll>;
using VP = vector<P>;
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll INF = 1LL << 60;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define rep2(i,s,n) for(ll i = s; i < n; i++)
#define per(i,n) for(ll i = n-1; i >= 0; i--)
#define per2(i,s,n) for(ll i = n-1; i >= s; i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return true;}return false;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return true;}return false;}
template<class T>void Vin(vector<T>&a){rep(i,(int)a.size())cin>>a[i];}
template<class T>void VVin(vector<vector<T>>&a){rep(i,(ll)a.size())Vin(a[i]);}
template<class T>void Vout(const vector<T>&a){rep(i,(ll)a.size()-1)cout<<a[i]<<" ";cout<<a.back()<<endl;}
template<class T>void Voutl(const vector<T>&a){rep(i,(ll)a.size())cout<<a[i]<<endl;}
ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}
const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};

struct Combination {
    long long m;
    vector<long long> fact, ifact;
    Combination(long long a, long long m): fact(a+1), ifact(a+1), m(m) {
        fact[0] = 1;
        for(int i = 1; i <= a; i++) fact[i] = fact[i-1]*i%m;
        ifact[a] = fact[a];
        long long inv = 1, b = m-2;
        while(b > 0) {
            if(b&1) inv = inv*ifact[a]%m;
            ifact[a] = ifact[a]*ifact[a]%m;
            b >>= 1;
        }
        ifact[a] = inv;
        for(int i = a; i >= 1; i--) ifact[i-1] = ifact[i]*i%m;
    }
    long long comb(long long a, long long b) {
        return fact[a]*ifact[b]%m*ifact[a-b]%m;
    }
} c(200000,mod);

int main() {
  ll n, k;
  cin >> n >> k;
  if(k == 0) {
    cout << 1 << endl;
    return 0;
  }
  if(k == 1) {
    if(n % 2 == 0) cout << 2 << endl;
    else cout << n - 2 << endl;
    return 0;
  }
  if(n == k) {
    cout << 1 << endl;
    return 0;
  }
  ll m = n - k, ans = 0;
  for(int i = 0; i <= m; i += 2) {
    ans = (ans + (i + 1) * c.comb(n - i - 2, k - 2)) % mod;
  }
  cout << ans << endl;
}