#include <cstdio>

using namespace std;

const int mod = 194767;

int n,s,dp[2][256*256+3];

int abs(int x){
    return x > 0 ? x : -x;
}

int main() {
    freopen("1-sir.in", "r", stdin);
    freopen("1-sir.out", "w", stdout);
    scanf("%d %d", &n, &s);

    if(s > n * (n-1)) {
        printf("0\n");
        return 0;
    }

    dp[0][0] = 1;

    bool p = 0;
    for(int i = 2; i <= n; ++i) {
        p ^= 1;
        for(int j = 0; j <= i*(i-1); ++j)
            dp[p][j] = (dp[p^1][abs(j-i+1)] + dp[p^1][abs(j+i-1)]) % mod;

    }


    printf("%d\n", dp[p][s]);
    return 0;
}