#pragma GCC target("avx2")
#pragma GCC optimize("Ofast,unroll-loops")
#include <stdio.h>

const int Mod = 998244353;

long long solve_n_square(int n, long long m)
{
	int i, j, coeff[200001] = {};
	long long ans[200001] = {1};
	for (i = 0; i <= n && i < m; i++) {
		switch (i % 6) {
		case 0:
		case 1:
			coeff[i] = (m - i) % Mod;
			break;
		case 3:
		case 4:
			coeff[i] = (Mod - (m - i) % Mod) % Mod;
			break;
		}
	}
	for (i = 1; i <= n; i++) {
		for (j = 0; j < i; j++) ans[i] += ans[i-j-1] * coeff[j] % Mod;
		ans[i] %= Mod;
	}
	return ans[n];
}

int main()
{
	int n;
	long long m;
	scanf("%d %lld", &n, &m);
	printf("%lld\n", solve_n_square(n, m));
	fflush(stdout);
	return 0;
}