#include<fstream>
#include<algorithm>

using namespace std;
ifstream f ("1-sir.in");
ofstream g ("1-sir.out");
	
const int lim = 32640,Mod = 194767,MaxN = 1 << 16;

int N,Din[2][MaxN];
long long S;

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

void solve()
{
	int i,j;
	Din[0][0] = 1;
	for(i = 2 ; i <= N ; i++)
		{
			for( j = 0 ; j <= lim ; j++)
				Din[1][j] = (Din[0][modul(j-i+1)] + Din[0][modul(j+i-1)])%Mod;
			for( j = 0 ; j <= lim ; j++)
				Din[0][j] = Din[1][j] , Din[1][j] = 0;
		}
}

int main ()
{
	f >> N >> S;
	solve();
	g << Din[0][modul(S)] << '\n';
	f.close();
	g.close();
	return 0;
}