#include <fstream>
#include <climits>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstring>
using namespace std;
ifstream fin ("1-sir.in");
ofstream fout("1-sir.out");
int n,i,j,t,S,nr1,D[2][66103];
const int MOD=194767;
int main()
{
    fin>>n>>S;
    if(S<0)
        S=-S;
    if(S>33000)
    {
        fout<<0;
        return 0;
    }
    D[0][0]=1;
    for(i=2;i<=n;i++)
    {
        t=1-t;
        memset(D[t],0,sizeof(D[t]));
        for(j=0;j<=i*(i+1)/2;j++)
            D[t][j]=(D[t][j]+D[1-t][abs(j-(i-1))]+D[1-t][abs(j+(i-1))])%MOD;
    }
    fout<<D[t][S]%MOD;
    return 0;
}