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

long long mod = 998244353;
long long power(long long a, long long b){
    long long p = a, ret = 1;
    for(int i=0; i<30; i++){
        if(b&(1<<i)) ret = ret*p %mod;
        p = p*p %mod;
    }
    return ret;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,K; cin >> N >> K;
    long long perN = power(N,mod-2);
    vector<vector<long long>> dp(K+1,vector<long long>(N+1));
    dp.at(0).at(0) = 1;
    for(int i=0; i<K; i++){
        for(int k=0; k<=N; k++){
            if(dp.at(i).at(k) == 0) continue;
            long long red = k*perN%mod;
            if(k) dp.at(i+1).at(k-1) = (dp.at(i+1).at(k-1)+dp.at(i).at(k)*red)%mod;
            if(k != N) dp.at(i+1).at(k+1) = (dp.at(i+1).at(k+1)+dp.at(i).at(k)*(mod+1-red))%mod;
        }
    }

    long long answer = 0;
    for(int i=0; i<=N; i++){
        if(dp.at(K).at(i) == 0) continue;
        long long out = (K-i)/2;
        answer = (answer+dp.at(K).at(i)*(out+N))%mod;
    }
    cout << answer << endl;
}