#include <fstream>
using namespace std;

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

int mod = 194767;
int dp[2][66000];
int main()
{
    int i, j, n, m, a = 33000, cur = 1;
    fin >> n >> m;
    dp[0][a] = 1;
    if(m > n*(n-1)/2 || m < -(n*(n-1)/2))
    {
        fout << "0\n";
        return 0;
    }
    for(i = 1; i < n; i ++)
    {
        for(j = -cur+a; j <= cur+a; j ++)
            dp[i&1][j] = (dp[!(i&1)][j-i] + dp[!(i&1)][j+i]) % mod;
        cur += i+1;
    }
    fout << dp[!(n&1)][m+a] << "\n";
}