#include<stdio.h>


const int maxn = 1000000;

int nr;
int n;
int m;
short a[maxn];
int j;
int i;
int s;


int modul(int m)
{
        if (m<0) return m*(-1);
        return m;
}

int main()
{
        freopen("1-sir.in","r",stdin);
        freopen("1-sir.out","w",stdout);
        scanf("%d %d",&n,&m);
        if ((modul(m)>(n*(n-1)/2))||(m%2!=(n*(n-1)/2)%2))
        {
                printf("0\n");
                return 0;
        }
        s=n*(n-1)/2-m;
        a[0]=1;
        for(i=1;i<=n-1;i++)
        {
                for(j=0;j<=s;j++)
                {
                        if (a[j]==1) a[j+2*i]=2;
                }
                if (a[s]==2)  nr++;
                for(j=0;j<=s;j++)
                {

                        if (a[j]==2) a[j]=1;

                }

        }
        printf("%d\n",nr%194767);
        return 0;
}