//calculam dinamic solutia asemanator rucsac
//d[lungime][suma]
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int i,j,n,s,d[260][33000];
int main()
{
   f>>n>>s;
   d[1][0]=1;
   for(i=2;i<=n;++i) //de la 2 la lungime
   {
        for(j=0;j<=i*(i-1)/2;++j) d[i][j]=(d[i-1][j+i-1]+d[i-1][abs(i-1-j)])%194767; //de la 0 la cat putem obtine maxim adica
        //0+1+2+...
   }
   g<<d[n][abs(s)];
}