#include <bits/stdc++.h>
using namespace std;

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

const int N = 260;
const int Mod = 194767;

int n, s, v, dp[N * N];

int main()
{
	fin >> n >> s;

	if (s > n * (n - 1) / 2)
	{
		fout << 0;
	}
	else
	{
		s = sqrt(s);

		dp[0] = 1;
		for (int i = 1; i < n; ++i)
			for (int j = s; j - i >= 0; --j)
				dp[j] = (dp[j] + dp[j - i]) % Mod;

		fout << dp[s];
	}
}