//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=998244353;
ll C[2020][2020];
ll val[2020];
ll f[2020][2020];
ll fact[2020];
ll pw[2020];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for(int i=0;i<2020;i++)
		C[i][i]=C[i][0]=1;
	for(int i=2;i<2020;i++)
		for(int j=1;j<i;j++)
			C[i][j]=(C[i-1][j]+C[i-1][j-1])%mod;
	for(int i=0;i<2020;i++)
	{
		f[i][0]=0;
		f[i][i]=1;
	}
	for(int i=2;i<2020;i++)
		for(int j=1;j<i;j++)
			f[i][j]=(f[i-1][j]*j+f[i-1][j-1])%mod;
	fact[0]=1;
	for(int i=1;i<2020;i++)
		fact[i]=fact[i-1]*i%mod;
	int n,k;
	cin>>n>>k;
	pw[0]=1;
	for(int i=1;i<2020;i++)
		pw[i]=pw[i-1]*n%mod;
	ll ans=0;
	for(int i=1;i<=min(n,k);i++)
		for(int j=1;j<=i;j++)
		{
			ll ways=C[n][i]*f[k][i]%mod*fact[i]%mod;
			ll ways2=f[i][j]*pw[k-i]%mod;
			ans=(ans+ways*ways2%mod*fact[j]%mod*C[n][j]%mod*(n-i+j))%mod;
			ans=(ans+mod-ways*ways2%mod*fact[j]%mod*C[n-1][j-1]%mod*(n-i)%mod)%mod;
		}
	cout<<ans<<'\n';
	return 0;
}