#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<random>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>

#define fi first
#define se second
#define max Max
#define min Min
#define abs Abs
#define lc (x<<1)
#define rc (x<<1|1)
#define mid ((l+r)>>1)
#define pb(x) push_back(x)
#define lowbit(x) ((x)&(-(x)))
#define fan(x) ((((x)-1)^1)+1)
#define mp(x,y) make_pair(x,y)
#define clr(f,n) memset(f,0,sizeof(int)*(n))
#define cpy(f,g,n) memcpy(f,g,sizeof(int)*(n))
#define SZ(x) ((int)(x.size()))
#define INF 0x3f3f3f3f

using namespace std;

inline int read()
{
	int ans=0,f=1;
	char c=getchar();
	while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){ans=(ans<<1)+(ans<<3)+c-'0';c=getchar();}
	return ans*f;
}

inline void write(int x)
{
	if(x<0) putchar('-'),x=-x;
	if(x/10) write(x/10);
	putchar((char)(x%10)+'0');
}

template<typename T>inline T Abs(T a){return a>0?a:-a;};
template<typename T,typename TT>inline T Min(T a,TT b){return a<b?a:b;}
template<typename T,typename TT> inline T Max(T a,TT b){return a<b?b:a;}

const int N=105,mod=1e9+7;
int n,k,f[2][N][N*N];

signed main()
{
	n=read();k=read();
	int now=0;
	f[0][0][0]=1;
	for(int i=0;i<n;++i)
	{
		memset(f[now^1],0,sizeof(f[now^1]));
		for(int j=0;j<=i;++j)
			for(int p=0;p<=k;++p)
				if(f[now][j][p])
				{
					if(j+1<=i) f[now^1][j+2][p]=(f[now^1][j+2][p]+f[now][j][p]*1ll*(i-j)%mod*(i-j))%mod;
					if(p+n-i<=k&&n-2*i+j>0) f[now^1][j+1][p+n-i]=(f[now^1][j+1][p+n-i]+f[now][j][p]*1ll*(i-j)%mod*(n-2*i+j)*2)%mod;
					if(p+(n-i)*2<=k&&n-2*i+j-1>0) f[now^1][j][p+(n-i)*2]=(f[now^1][j][p+(n-i)*2]+f[now][j][p]*1ll*(n-2*i+j)%mod*(n-2*i+j-1))%mod;
					if(n-i*2+j>0) f[now^1][j+1][p+n-i]=(f[now^1][j+1][p+n-i]+f[now][j][p]*1ll*(n-i*2+j))%mod;
				}
		now^=1;
	}
	write(f[now][n][k]);
	return 0;
}