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

const int kMax = 256;
const int kMaxS = kMax * (kMax - 1) / 2;
const int kMod = 194767;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int n, s, dp[kMax][kMaxS];

int main()
{
	fin >> n >> s;
	s = abs(s);
	if (n * (n - 1) / 2 < s)
	{
		fout << "0\n";
		return 0;
	}

	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][abs(j - (i - 1))] + dp[i - 1][abs(j + (i - 1))]) % kMod;

	fout << dp[n][s] << '\n';
	return 0;
}