#include <cstdio>
using namespace std;
int D[2][131000],nMax,n,S,i,j,sol;
int main()
{
    freopen("1-sir.in", "r", stdin);
    freopen("1-sir.out", "w", stdout);
    scanf("%d%d", &n, &S);
    nMax=n*(n-1)/2;
    if(S<=nMax&&S>=(-1*nMax))
    {
        D[0][nMax]=1;
        for(i=2;i<=n;i++)
        {
            for(j=i-1;j<=2*nMax-i+1;j++)
                D[1][j]=D[0][j-i+1]+D[0][j+i-1];
            for(j=0;j<=2*nMax;j++)
                D[0][j]=D[1][j], D[1][j]=0;
        }
        sol=D[0][S];
    }
    printf("%d", sol);

    return 0;
}