#include<cstdio>


using namespace std;

const int nmax=305;

int d[2][2*nmax*nmax+30];


int main()
{
    int n,i,j,s;
    freopen("1-sir.in","r",stdin);
    freopen("1-sir.out","w",stdout);
    scanf("%d%d",&n,&s);
    int truj;
    d[1][nmax]=1;
    for(i=2;i<=n;++i)
    {
        for(j=-n*(n-1)/2 -10;j<=n*(n-1)/2 +10;++j)
        {
            truj=j+nmax;
            d[i&1][truj]=d[(i-1)&1][truj+i-1]+d[(i-1)&1][truj-i+1];
            d[i&1][truj]%=194767;
        }
        if(i!=n-1)
            for(j=-n*(n-1)/2 -10;j<=n*(n-1)/2 +10;++j)
            {
                truj=j+nmax;
                d[(i+1)&1][truj]=0;
            }
    }
    printf("%d",d[n&1][s+nmax]);
}