#include <fstream>
#include <algorithm>

using namespace std;

FILE *f=fopen("1-sir.in","r");
FILE *g=fopen("1-sir.out","w");

int n,s;

int dp[257][32641];

int modul(int x)
{
    if( x >= 0 )
        return x;
    return -x;
}

void solve()
{
    dp[1][0] = 1;

    for(int i = 2; i <= n; i++)
        for(int j = 0; j <= i*(i-1)/2; j++)
            dp[i][j] = (dp[i-1][modul(j - (i-1))] + dp[i-1][modul(j + (i-1))])%194767;

    fprintf(g,"%d",dp[n][s]);

}

int main()
{
    fscanf(f,"%d %d",&n,&s);

    solve();


    fclose(f);
    fclose(g);


    return 0;
}