#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<cassert>
#include<set>
#include<queue>
#include<cstdint>
#include<unordered_map>
using namespace std;
using ll = long long;


#include<atcoder/modint>
using mint = atcoder::modint998244353;


const int mx = 1e6;
mint fac[mx+1],ifac[mx+1];
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    fac[0] = 1;
    for(int i = 1;i<=mx;i++) fac[i] = fac[i-1] * i;
    for(int i = 0;i<=mx;i++) ifac[i] = fac[i].inv();
    ll n,q;
    cin>>n>>q;
    mint ans = 0;
    mint tmp = 0;
    tmp = 1;
    for(int i = 1;i<=n;i++){
        ans += mint(n+1) * fac[i] * fac[n+1-i] * (fac[n]*ifac[i]*ifac[n-i]) / (i+1);
    }
    ans *= mint(q) * ( mint(n) * mint(n+1) *(mint(2).inv())).pow(q-1);
    cout<<ans.val()<<endl;
}