#include <set>
#include <map>
#include <list>
#include <queue>
#include <cmath>
#include <time.h>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <stdio.h>
#include <iomanip>
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define mk make_pair
#define fi first
#define se second

inline int read(){
	int t = 0,f = 1;
	register char c = getchar();
	while (c < 48 || c > 57) f = (c == '-') ? (-1) : (f),c = getchar();
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = getchar();
	return f * t;
}

const int N = 150 + 3,MOD = 1e9 + 7;
int n,k;
ll dp[2][N][N * N],C[N][N];

inline void add(ll &x,ll v) {x += v;if (x >= MOD) x -= MOD;}

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
#endif
	n = read(),k = read();
	for (int i = 1;i <= n;i++){
		C[i][0] = 1;
		for (int j = 1;j <= i;j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
	}
	int lst = 1,cur = 0,s = n * n;
	dp[cur][0][0] = 1;
	for (int i = 1;i <= n;i++){
		lst ^= 1,cur ^= 1;
		memset(dp[cur],0,sizeof(dp[cur]));
		for (int j = 0;j <= n;j++){
			for (int k = 0;k <= s;k++){
				if (!dp[lst][j][k]) continue;
				ll v = dp[lst][j][k];
				add(dp[cur][j + 1][k],v);//孤立点
				add(dp[cur][j][k + i],v);//自环
				add(dp[cur][j][k + i],v * j * 2ll % MOD);//接到一个链上
				if (j >= 2) add(dp[cur][j - 1][k + 2 * i],v * j % MOD * (j - 1) % MOD);//合并两个链
				if (j) add(dp[cur][j - 1][k + 2 * i],v * j % MOD);//链->环
			}
		}
	}
	ll fct = 1;
	for (int i = 1;i <= n;i++) fct = fct * i % MOD;
	printf("%lld\n",dp[cur][0][k] * fct % MOD);
	return 0;
}