#include <bits/stdc++.h>

using namespace std;
#define int long long
const int p=998244353;
int po(int a,int b) {if(b==0) return 1; if(b==1) return a; if(b%2==0) {int u=po(a,b/2);return (u*u)%p;} else {int u=po(a,b-1);return (a*u)%p;}}
int inv(int x) {return po(x,p-2);}
const int maxn=5e3+5;
int ways[maxn];int ways2[maxn];
int res;
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,k;cin>>n>>k;ways[0]=1;int in=inv(n);res=n;
    for(int i=0;i<k;++i)
    {
        fill(ways2,ways2+maxn,0);
        for(int j=0;j<=n;++j)
        {
            ways2[j+1]+=(((n-j)*in)%p)*ways[j];ways2[j+1]%=p;
            if(j) {int h=(((j*in)%p)*ways[j])%p;ways2[j-1]+=h;ways2[j-1]%=p;res+=h;res%=p;}
        }
        copy(ways2,ways2+maxn,ways);
    }
    cout<<(res%p+p)%p;
    return 0;
}