#include <fstream>
using namespace std;

ifstream fin("1-sir.in");
ofstream fout("1-sir.out");

int dp[2][40000];
//dp[i][j] = numarul de siruri de lungime i pe care le pot forma cu suma in modui j / 2

const int r = 194767;

int main()
{
    int n, i, j, smax, s;
    fin >> n >> s;
    if (s < 0)
        s = -s;
    if (s > n*(n-1)/2)
    {
        fout << 0;
        return 0;
    }
    smax = n*(n-1)/2;
    dp[1][0] = 1;
    for (i = 2; i<=n; i++)
        //adunam i-1
        for (j = 0; j<=smax; j++)
            dp[i&1][j] = dp[(i-1)&1][j+i-1] + dp[(i-1)&1][abs(j-i+1)];
    fout << dp[n&1][s];
    return 0;
}