/* monkukui 競技プログラミング用のテンプレート  (ここから) */
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>

using namespace std;
using lint = long long int;
using ll = long long int;
using lnt = long long int;
using graph = vector<vector<int>>;
using wgraph = vector<vector<pair<int, long long int>>>;
long long int INF = 1001001001001001LL;
int inf = 100100100;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
long long int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
long long int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
inline void yes(){ cout << "yes" << endl; }
inline void Yes(){ cout << "Yes" << endl; }
inline void YES(){ cout << "YES" << endl; }
inline void no(){ cout << "no" << endl; }
inline void No(){ cout << "No" << endl; }
inline void NO(){ cout << "NO" << endl; }
inline void possible(){ cout << "possible" << endl; }
inline void Possible(){ cout << "Possible" << endl; }
inline void POSSIBLE(){ cout << "POSSIBLE" << endl; }
inline void impossible(){ cout << "impossible" << endl; }
inline void Impossible(){ cout << "Impossible" << endl; }
inline void IMPOSSIBLE(){ cout << "IMPOSSIBLE" << endl; }

#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for(int i = s; i < t; i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back

/* monkukui 競技プログラミング用のテンプレート (ここまで)*/

lint dp[52][52][52 * 52] = {};

int main(){
  
  int N, K; cin >> N >> K;
  dp[0][0][0] = 1; 
  
  for(int i = 0; i < N; i++) {
    for(int j = 0; j <= N; j++) {
      for(int k = 0; k <= K; k++) {
        int ni = i + 1;
        // 隣同士をつなぐ
        {
          int nj = j;
          int nk = k + 2 * nj;
          dp[ni][nj][nk] += dp[i][j][k];
          dp[ni][nj][nk] %= MOD;
        }

        // どちらも保留にする
        {
          int nj = j + 1;
          int nk = k + 2 * nj;
          dp[ni][nj][nk] += dp[i][j][k];
          dp[ni][nj][nk] %= MOD;
        }

        // 左だけ保留とつなぐ (右は保留)
        if(j != 0) {
          int nj = j;
          int nk = k + 2 * nj;
          dp[ni][nj][nk] += dp[i][j][k] * j;
          dp[ni][nj][nk] %= MOD;
        }

        // 右だけ保留とつなぐ (左は保留)
        if(j != 0) {
          int nj = j;
          int nk = k + 2 * nj;
          dp[ni][nj][nk] += dp[i][j][k] * j;
          dp[ni][nj][nk] %= MOD;
        }
        
        // 両方保留とつなぐ
        if(j != 0) {
          int nj = j - 1;
          int nk = k + 2 * nj;
          dp[ni][nj][nk] += dp[i][j][k] * j * j;
          dp[ni][nj][nk] %= MOD;
        }
      }
    }
  }

  /*
  for(int i = 0; i <= N; i++) {
    for(int j = 0; j <= N; j++) {
      for(int k = 0; k <= K; k++) {
        cerr << "dp[" << i << "][" << j << "][" << k << "] = " << dp[i][j][k] << endl;
      }
    }
  }*/

  cout << dp[N][0][K] << endl;
  return 0;
}


Measured memory_bytes: 55168