#include <bits/stdc++.h>
#define MOD 194767

using namespace std;

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

int n, s, i, j, sm;
int d[66565];

//d[i][j] = nr de 1-siruri de lungime i si cu suma j, insa fac pe o singura linie

int main(){
    fin >> n >> s;
    sm = n*(n-1)/2;
    s = (sm - s)/2;
    if (s < 0 || s > sm){
        fout << 0;
        return 0;
    }
    d[0] = 1;
    for (i=1; i<n; i++){
        for (j=s; j-i>=0; j--){
            d[j] = (d[j] + d[j-1])%MOD;
        }
    }
    fout << d[s];
    return 0;
}