#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <atcoder/modint>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
using Modint = atcoder::static_modint<998244353>;

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N, Q; cin >> N >> Q;
    Modint ans = 0;
    for(int x=1; x<=N; x++){
        ans += Modint(N-x+1) * Modint(N+1) / Modint(x+1);
    }
    ans *= Q;
    for(int i=1; i<=N; i++) ans *= Modint(i);
    ans *= (Modint(N) * Modint(N+1) / Modint(2)).pow(Q-1);
    cout << ans.val() << endl;
    return 0;
}