#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

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

const int mod=194767;

int dp[200000];
int n, s;

int modul(int n)
{
    if(n<0) return -n;
    else return n;
}

int main()
{
    fin>>n>>s;
    int nr=n*(n-1)/2;
    if(s>nr || s<-nr)
    {
        fout<<"0\n";
        return 0;
    }
    dp[nr]=1;
    for(int i=2; i<=n; ++i)
    {
        for(int j=0; j<=nr; ++j)
        {
            dp[j]=(dp[j]+dp[j+2*(n-i+1)])%mod;
        }
    }
    fout<<dp[modul(s)]<<"\n";
    return 0;
}