#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;

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

const int MAXN = 256, MAXS = (MAXN-1)*MAXN/2, MOD = 194767;

int N, S, dp[MAXN+1][MAXS+1];

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

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

    for(int i = 2; i <= N; i++)
    {
        for(int j = -i*(i-1)/2; j <= i*(i-1)/2; j++)
        {

            dp[i][j] = (dp[i-1][modul(j - (i-1))] + dp[i-1][modul(j + (i-1))])%MOD;
        }
    }

    out<<dp[N][S];


}


int main()
{
    in>>N>>S;
    solve();
    return 0;
}