#include <bits/stdc++.h>
#define MOD 194767
typedef long long ll;
ll n, s, i, j, k;
ll sol[35000];
int main()
{
    freopen("1-sir.in", "r", stdin);
    freopen("1-sir.out", "w", stdout);
    scanf("%lld%lld", &n, &s);
    s=((n*(n-1)/2)-s)/2;
    if(s<0 || s>n*(n-1)/2){
        printf("0");
        return 0;
    }
    sol[0]=1;
    for(i=1; i<n; ++i){
        for(j=s; j-i>=0; --j){
            sol[j]=(sol[j]+sol[j-i])%MOD;
        }
    }
    printf("%lld", sol[s]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}