#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ; 
typedef vector<int> vi;
typedef unsigned int uint ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MOD = 1e9 + 7 ;
const int MAXN = 107 ;

int n , k ;
ll dp[ 2 ][ MAXN * MAXN ][ MAXN ] ;

void solve ( ) {
    cin >> n >> k ;
    int prv = 0 , nxt = 1 ;
    dp[ prv ][ 0 ][ 0 ] = 1 ;
    for ( int i = n ; i >= 1 ; -- i ) {
        for ( int sm = 0 ; sm <= k ; ++ sm ) {
            for ( int j = 0 ; j <= n ; ++ j ) {
                if ( dp[ prv ][ sm ][ j ] == 0 ) { continue ; }
                ll half = ( n - i ) - j , emp = n - 2 * half - j ;
                // matching
                if ( emp >= 1 ) {
                    dp[ nxt ][ sm + i ][ j + 1 ] += dp[ prv ][ sm ][ j ] * emp ;
                    dp[ nxt ][ sm + i ][ j + 1 ] %= MOD ;
                }
                // both covered
                if ( half >= 1 ) { 
                    dp[ nxt ][ sm ][ j + 2 ] += dp[ prv ][ sm ][ j ] * half * half ;
                    dp[ nxt ][ sm ][ j + 2 ] %= MOD ;
                }
                // one side covered
                if ( half >= 1 && emp >= 1 ) {
                    dp[ nxt ][ sm + i ][ j + 1 ] += 2 * dp[ prv ][ sm ][ j ] * half * emp ;
                    dp[ nxt ][ sm + i ][ j + 1 ] %= MOD ;
                }
                // both sides empty
                if ( emp >= 2 ) {
                    dp[ nxt ][ sm + 2 * i ][ j ] += dp[ prv ][ sm ][ j ] * emp * ( emp - 1 ) ;
                    dp[ nxt ][ sm + 2 * i ][ j ] %= MOD ;
                }
                dp[ prv ][ sm ][ j ] = 0 ;
            }
        }
        prv ^= 1 , nxt ^= 1 ;
    }
    cout << dp[ prv ][ k ][ n ] << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}