using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

internal partial class Solver {
    const int mod = 1000000000 + 7;

    static void Add(ref long x, long v) {
        x += v;
        if (x >= mod) x %= mod;
    }

    public void Run() {
        var n = ni();
        var k = ni();

        // dp[i,j,k] = i番目の時点で j 個保留にして oddness が k であることが確定する場合の数
        var dp = new long[n + 1, n + 1, k + 1];
        dp[0, 0, 0] = 1;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= n; j++) {
                for (int p = 0; p <= k; p++) {
                    var val = dp[i, j, p];
                    if (val == 0) continue;
                    if (p + j * 2 <= k) {
                        // choose (i,i) pair
                        Add(ref dp[i + 1, j, p + j * 2], val);
                        // choose (i,q) pair (pattern j)
                        Add(ref dp[i + 1, j, p + j * 2], j * val % mod);
                        // choose (q,i) pair (pattern j)
                        Add(ref dp[i + 1, j, p + j * 2], j * val % mod);
                    }
                    // choose (x,_) and (_,y) pairs
                    if (j > 0 && p + (j - 1) * 2 <= k) {
                        Add(ref dp[i + 1, j - 1, p + (j - 1) * 2], j * j % mod * val % mod);
                    }
                    // not select
                    if (p + (j + 1) * 2 <= k && j + 1 <= n) {
                        Add(ref dp[i + 1, j + 1, p + (j + 1) * 2], val);
                    }
                }
            }
        }

        cout.WriteLine(dp[n, 0, k]);
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

    public void RunMulti() {
        while (HasNext()) {
            Run();
        }
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        var array = new string[size];
        for (var i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        var array = new int[size];
        for (var i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        var array = new long[size];
        for (var i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        var array = new double[size];
        for (var i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            var line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (var token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}


Measured memory_bytes: 58080