#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize(2)
using namespace std;
int n, f[55][55][2505], m;
const int mod = 998244353;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	if (m > n * n) {
		cout << 0;
		return 0;
	}
	f[n + 1][0][0] = 1;
	int op = 0, opp;
	for (int i = n; i >= 1; i--) {
		for (int j = 0; j <= n * n; j++) {
			for (int k = 0; k <= n; k++) {
				if (!f[i + 1][k][j]) continue;
				op =  (n - i), opp = n - 2 * (n - i) + k;
				f[i][k + 1][j + i] = (	f[i][k + 1][j + i] + f[i + 1][k][j] * opp % mod) % mod;
				f[i][k + 1][j + i] = (	f[i][k + 1][j + i] + f[i + 1][k][j] * (op - k) % mod * opp % mod * 2 % mod) % mod;
				if (opp >= 2) f[i][k][j + 2 * i] = (f[i][k][j + 2 * i]  + f[i + 1][k][j] * opp % mod * (opp - 1) % mod) % mod;
				if (op - k >= 1) f[i][k + 2][j] = (f[i][k + 2][j ]  + f[i + 1][k][j] * (op - k) % mod * (op - k) % mod) % mod;
			}
		}
	}
	int ans = 0;
	for (int i = m; i <= n * n; i++) {
		ans = (ans + f[1][n][i]) % mod;
	}
	cout << ans;
}