#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr ll MOD = 1e9 + 7;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int d, r;
    cin >> d >> r;
    vector<vector<ll>> cnt(d + 1, vector<ll>(r * r + 1));
    vector<vector<ll>> sum(d + 1, vector<ll>(r * r + 1));
    cnt[0][0] = 1;
    for (int i = 1; i <= d; ++i)
    {
        for (int j = 0; j <= r * r; ++j)
        {
            for (int k = -50; k <= 50; ++k)
            {
                if (j < k * k)
                    continue;
                cnt[i][j] += cnt[i - 1][j - k * k];
                cnt[i][j] %= MOD;
                sum[i][j] += sum[i - 1][j - k * k] + abs(k) * cnt[i - 1][j - k * k];
                sum[i][j] %= MOD;
            }
        }
    }
    ll res = 0;
    for (int i = 0; i <= r * r; ++i)
    {
        res += sum[d][i];
        if (res >= MOD)
            res -= MOD;
    }
    cout << res << '\n';
    return 0;
}