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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define FILL(a, val) memset(a, val, sizeof a)
#define MP make_pair
#define PB push_back
#define F first
#define S second


typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int mod = 998244353;
int add(int a, int b){
	return (a + b > mod) ? (a + b - mod) : (a + b);
}
int sub(int a, int b){
	return (a - b < 0) ? (a - b + mod) : (a - b);
}
int mult(int a, int b){
	return 1LL* a * b % mod;
}
int binpow(int a, int n){
	int res = 1;
	while(n){
		if(n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

const int N = 100;
int dp[N][N];
int fact[N], ober[N];
int C(int n, int k){
	if(k < 0 || k > n)
		return 0;
	return mult(fact[n], mult(ober[k], ober[n - k]));
}
void pre(){
	fact[0] = 1;
	FOR(i, 1, N)
		fact[i] = mult(fact[i - 1], i);
	ober[N - 1] = binpow(fact[N - 1], mod - 2);
	RFOR(i, N, 1)
		ober[i - 1] = mult(ober[i], i);
}


int solve(int n, int m){
	if(m > n)
		return 0;
	if(n == 0)
		return 1;
	if(dp[n][m] != -1)
		return dp[n][m];
	int ans = 0;
	FOR(k, 0, m + 1){
		int cur = mult(C(m, k), solve(n - 1, m - k));
		ans = add(ans, cur);
	}
	return dp[n][m] = ans;
}

int ans(int n, int m){
	int res = n + 1 - m;
	FOR(i, 0, m - 1)
		res = mult(res, n + 1);
	return res;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	cout << ans(n, m) << endl;

/*	pre();
	FILL(dp, -1);
	
	FOR(n, 1, N){
		FOR(m, 1, n + 1){
			cout << solve(n, m) << " ";
			assert(solve(n, m) == ans(n, m));
		}
		cout << endl;
	}
*/		
	
	
	
	return 0;
}