#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
 
const int mod = 194767;
const int smax = 40000;
int dp[smax][2];

int solve(int S, int N)
{		
	dp[0][0] = 1;
	int nxt = 0, smaxim = (N * (N - 1)) / 2;
	if(abs(S) > smaxim)
		return 0;
	for(int i = 2;i <= N;++i, nxt ^= 1)
	{
		int L = (i * (i - 1)) / 2;
		for(int j = 0;j <= L;++j)
		{
			dp[j][nxt ^ 1] = dp[abs(j - i + 1)][nxt] + dp[j + i - 1][nxt];
			if(dp[j][nxt ^ 1] >= mod)
				dp[j][nxt ^ 1] -= mod;
		}
	}
	return dp[abs(S)][nxt];
}
 
int main() {
	ifstream in("1-sir.in");
	ofstream out("1-sir.out");
	int N, S;
	
	in >> N >> S;
	out << solve(S, N) << "\n";
	in.close();
	out.close();
	return 0;
}