#include <stdio.h>

const int Mod = 998244353;

long long solve_slow(int n, int m)
{
	int i, j, k, l;
	long long dp[203][203] = {};
	for (i = 1, dp[1][m+1] = 1; i <= n; i++) {
		for (j = 2; j <= m + 1; j++) {
			dp[i][j] %= Mod;
			if (dp[i][j] == 0) continue;
			for (k = 1; k <= m; k++) {
				if (k == j) continue;
				for (l = 1; i + l <= n + 1 && k + l - 1 <= m; l++) dp[i+l][k+l] += dp[i][j] * l % Mod;
			}
		}
	}
	
	long long ans = 0;
	for (j = 2; j <= m + 1; j++) ans += dp[n+1][j];
	return ans % Mod;
}

int main()
{
	int n;
	long long m;
	scanf("%d %lld", &n, &m);
	if (n <= 200 && m <= 200) printf("%lld\n", solve_slow(n, m));
	else return -1;
	fflush(stdout);
	return 0;
}