#include <cstdio>
#include <algorithm>

using namespace std;

long long dp[2][140000];

int main ()
{
    freopen ("1-sir.in", "r", stdin);
    freopen ("1-sir.out", "w", stdout);

    int n, sum;
    scanf ("%d %d", &n, &sum);

    int mi = -n * (n + 1) / 2 + 70000;
    int ma = n * (n + 1) / 2 + 70000;

    if (sum > ma || sum < mi)
    {
        printf ("0\n");
        return 0;
    }

    for (int i = mi; i <= ma; ++i)
        dp[0][i] = 2000000000000000LL;

    dp[0][70000] = 0LL;

    for (int i = 1; i <= n; ++i)
    {
        for (int j = mi; j <= ma; ++j)
        {
            if (j + i <= ma && dp[(i & 1) ^ 1][i] != 2000000000000000LL) dp[i & 1][j + i] += dp[(i & 1) ^ 1][i];
            if (j - i >= ma && dp[(i & 1) ^ 1][i] != 2000000000000000LL) dp[i & 1][j - i] += dp[(i & 1) ^ 1][i];
        }

        for (int j = mi; j <= ma; ++j)
            dp[0][j] = dp[1][j],
            dp[1][j] = 0LL;;
    }

    printf ("%lld\n", dp[n & 1][sum + 70000]);

    return 0;
}