#include <iostream>
#define MAX 10000
#define mod 194767
#include <algorithm>
#include <fstream>
using namespace std;
int n;
long long s;
int d[MAX][MAX];

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

int maxim(int a,int b)
{
    if(a>b)return a;
    return b;
}

int main()
{   int i,j;
    fin>>n>>s;
    if(s<0)s=-s;
    d[0][0]=1;
    for(i=2;i<=n;++i){
        for(j=0;j<=i*(i-1)/2;++j)
            d[1][j]=d[0][j+(i-1)]+d[0][abs(j-(i-1))];
        for(int k=0;k<=i*(i-1)/2;++k){
                d[0][k]=d[1][k]%mod;
                d[1][k]=0;

        }

        }


        fout<<d[0][s];
    return 0;
}