#include <cstdio>
#include <algorithm>

using namespace std;

#define SMAX 1 << 16
#define MOD 194767

int A[SMAX], B[SMAX], n, i, j, x, y, S;

int main () {
	
	freopen ("1-sir.in", "r", stdin);
	freopen ("1-sir.out", "w", stdout);
	
	scanf ("%d %d", &n, &S);
	
	if (S > n * (n-1) / 2 || S < - n * (n-1) / 2)
		printf ("0");
	else {
		A[0] = 1;
		for (i = 2; i <=  n; i++) {
			for (j = 0; j <= n * (n-1) / 2; j++) {
				x = j - (n-i+1); if (x < 0) x = -x;
				B[j] = (B[j] + A[x]) % MOD;
				y = j + (n-i+1); if (y < 0) y = -y;
				B[j] = (B[j] + A[y]) % MOD;
			}
			
			memcpy (A, B, sizeof(B));
			memset (B, 0, sizeof(B));
		}
		
		if (S >= 0)
			printf ("%d", A[S]);
		else
			printf ("%d", A[-S]);
	}
	
	return 0;
}