#include <iostream>
#define mod 194767
#include <algorithm>
#include <fstream>
using namespace std;

int n;
long long s;
int d[10000][10000];

ifstream f("1-sir.in");
ofstream g("1-sir.out");

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

int main()
{
    int i,j;
    f >> 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;

        }
    }

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