#include <fstream>
#include <cmath>

using namespace std;

const int MAX_SUM = (256 * 257) / 2;
const int MOD = 194767;
int dp[2][MAX_SUM + 1];
long long n, s;

int main() {
    ifstream fin("1-sir.in");
    ofstream fout("1-sir.out");
    fin >> n >> s;
    int maxsum = n * (n - 1) / 2;
    if (maxsum < abs(s)) {
        fout << "0";
        return 0;
    }
    dp[1][0] = 1;
    for (int i = 1; i < n; i++) {
        for (int j = 0; j <= i * (i + 1); j++) {
            dp[(i & 1) ^ 1][j] = (dp[i & 1][abs(j + i)] + dp[i & 1][abs(j - i)]) % MOD;
        }
    }
    fout << dp[n & 1][abs(s)];
    return 0;
}