#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;

void mInc(int& a, int b) {
	a += b;
	if (a >= MOD) a -= MOD;
}

const int N = 100;
const int K = N * N;
int dp[2][N][K + 1];

// DP[n][m][s]: Ways to have a permutation of length n, where we ignore m positions, and have sum s
int solve(int max_n, int tar_k) {
	dp[0][0][0] = 1;
	for (int n = 0; n < max_n; ++n) {
		int c = n & 1;
		int t = c ^ 1;
		for (int m = 0; m <= n; ++m) {
			for (int s = 0; s <= n*n; ++s) {
				ll v0 = dp[c][m][s];
				if (v0 == 0) continue;
				
				// cerr << n << ' ' << m << ' ' << s << ": " << v0 << '\n';
				ll v1 = v0 * m % MOD;
				int add = n + 1;

				mInc(dp[t][m + 1][s], v0);			// n at last position, ignore last position
				mInc(dp[t][m][s + add], v0);			// n at last position, DO NOT ignore last position
				mInc(dp[t][m][s + add], v1);			// n NOT at last position, ignore last position, n hits a non-ignoring position
				if (m > 0) mInc(dp[t][m - 1][s + 2*add], v1);	// n NOT at last position, DO NOT ignore last position, n hits a non-ignoring position
				mInc(dp[t][m + 1][s], v1);			// n NOT at last position, ignore last position, n hits a ignoring position
				mInc(dp[t][m][s + add], v1);			// n NOT at last position, DO NOT ignore last position, n hits a ignoring position
			
				dp[c][m][s] = 0;
			}
		}
	}
	/*
	for (int m = 0; m <= max_n; ++m) {
		for (int s = 0; s <= max_n*max_n; ++s) {
			ll v0 = dp[max_n & 1][m][s];
			if (v0 == 0) continue;
			cerr << max_n << ' ' << m << ' ' << s - K << ": " << v0 << '\n';
		}
	}
	*/

	return dp[max_n & 1][0][tar_k];
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n, k;
	cin >> n >> k;
	
	ll res = solve(n, k);
	for (int i = 1; i <= n; ++i) res = (res * i) % MOD;
	cout << res << '\n';
}