#include #include using namespace std; using namespace atcoder; // using mint = modint1000000007; // const int mod = 1000000007; using mint = modint998244353; const int mod = 998244353; // const int INF = 1e9; // const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i, l, r) for (int i = (l); i < (r); ++i) #define rrep(i, n) for (int i = (n)-1; i >= 0; --i) #define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define P pair template inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; } int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); // 9640 int n, k; cin >> n >> k; int lim = (3 * n + 1) * n / 2; if (k > lim) { cout << 0 << endl; return 0; } // no matich sum vector dp(n + 1, vector(lim + 1)); dp[0][0] = 1; rep(i, n * 2) { vector ndp(n + 1, vector(lim + 1)); int x = i + 1; rep(j, n + 1)rep(k, lim + 1) { { // use int nj = j + 1; int nk = k + x; if (nj <= n && nk <= lim)ndp[nj][nk] += dp[j][k]; } if (j) { // nouse int nj = j - 1; int nk = k; ndp[nj][nk] += dp[j][k] * j; } } dp.swap(ndp); } auto ans = dp[0][k]; rep(i, n)ans *= i + 1; cout << ans.val() << endl; return 0; }