/*
    Author: YZB
    Problem:
    Time:
*/
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7) 
#define rep(_i_,_l_,_r_) for(int _i_=_l_;_i_<=_r_;_i_++)
//#define FILE
using namespace std;
int dp[2][105][10005];
signed main(){
#ifdef FILE
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n,m;
	cin>>n>>m;
	dp[0][0][0]=1;
	int p=0,c1,c2,c0;
	for(int i=n;i>=1;i--){
		p^=1;
		memset(dp[p],0,sizeof dp[p]);
		for(int j=0;j<=n;j++){
			for(int k=0;k<=n*n;k++){
				if(!dp[p^1][j][k])continue;
				c1=j,c2=((n-i)-j),c0=n-c1-c2;
				dp[p][j][k+i]+=dp[p^1][j][k]*c0%mod;
				dp[p][j][k+i]%=mod;
				if(j>=1){
					dp[p][j-1][k]+=dp[p^1][j][k]*((c1*c1)%mod)%mod;
					dp[p][j-1][k]%=mod;
				}
				dp[p][j][k+i]+=dp[p^1][j][k]*c1%mod*c0*2ll%mod;
				dp[p][j][k+i]%=mod;
				if(j+1<=n){
					dp[p][j+1][k+2*i]+=dp[p^1][j][k]*(c0*(c0-1)%mod)%mod;
					dp[p][j+1][k+2*i]%=mod;
				}
			}
		}
	}
	cout<<dp[p][0][m]<<'\n';
	return 0;
}