#include <iostream>
#include <vector>

using std::vector;

template <class T>
T genv(T v) { return v; }

template <class T, class... Ts>
auto genv(size_t l, Ts... ts) {
    return vector<decltype(genv<T>(ts...))>(l, genv<T>(ts...));
}

template <int MOD>
class ModInt {
    using lint = long long;

public:
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // assignment
    ModInt& operator=(const ModInt& x) {
        if (this != &x) { this->val = x.val; }
        return *this;
    }

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt operator~() const { return *this ^ (MOD - 2); }

    // increment / decrement
    ModInt& operator++() { return *this += 1; }
    ModInt& operator--() { return *this -= 1; }
    ModInt operator++(int) {
        ModInt before = *this;
        ++(*this);
        return before;
    }
    ModInt operator--(int) {
        ModInt before = *this;
        --(*this);
        return before;
    }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator%(const ModInt& x) const { return ModInt(*this) %= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt operator^(const ModInt& x) const { return ModInt(*this) ^= x; }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator%=(const ModInt& x) {
        val %= x.val;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= ~x; }
    ModInt& operator^=(const ModInt& x) {
        int n = x.val;
        ModInt b = *this;
        if (n < 0) n = -n, b = ~b;

        *this = 1;
        while (n > 0) {
            if (n & 1) *this *= b;
            n >>= 1;
            b *= b;
        }
        return *this;
    }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }
    bool operator<(const ModInt& b) const { return val < b.val; }
    bool operator<=(const ModInt& b) const { return val <= b.val; }
    bool operator>(const ModInt& b) const { return val > b.val; }
    bool operator>=(const ModInt& b) const { return val >= b.val; }

    // I/O
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
};

constexpr int MOD = 1000000007;
using mint = ModInt<MOD>;

constexpr int offset = 50 * 51 / 2;

int main() {
    int n, k;
    std::cin >> n >> k;
    if (k % 2) {
        std::cout << 0 << std::endl;
        return 0;
    }

    static auto dp = genv<mint>(n + 1, offset * 2 + 1, mint(0)),
                ndp = genv<mint>(n + 1, offset * 2 + 1, mint(0));
    dp[0][offset] = 1;

    for (int i = 1; i <= n; ++i) {
        for (auto& v : ndp) {
            std::fill(v.begin(), v.end(), mint(0));
        }

        for (int x = 0; x <= i; ++x) {
            for (int s = 0; s <= offset * 2; ++s) {
                // p[i] = i
                ndp[x][s] += dp[x][s];

                // go to high
                // x += 1, s -= i
                if (x < i) {
                    // come from low
                    // x -= 1, s += i
                    if (x > 0) {
                        ndp[x][s] += dp[x][s] * x;
                    }

                    // come from high
                    // y += 1, s -= i
                    if (x < i && s - i >= 0) {
                        ndp[x + 1][s - i] += dp[x][s];
                    }
                }

                // go to low
                // y -= 1, s += i
                if (x > 0) {
                    // come from low
                    // x -= 1, s += i
                    if (x > 0 && s + i <= offset * 2) {
                        ndp[x - 1][s + i] += dp[x][s] * x * x;
                    }

                    // come from high
                    // y += 1, s -= i
                    if (x < i) {
                        ndp[x][s] += dp[x][s] * x;
                    }
                }
            }
        }
        std::swap(dp, ndp);
    }

    std::cout << dp[0][k / 2 + offset] << std::endl;
    return 0;
}


Measured memory_bytes: 1280