#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int MOD=194767;
int cate[256*255/2+1];
int main()
{
    freopen("1-sir.in","r",stdin);
    freopen("1-sir.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,s,i,j;
    cin>>n>>s;
    if(abs(s)>n*(n-1)/2||n*(n-1)/2%2!=s%2)
    {
        cout<<0;
        return 0;
    }
    cate[0]=1;
    for(i=1;i<=n-1;i++)
        for(j=i*(i+1)/2;j>=i;j--)
            cate[j]=(cate[j]+cate[j-i])%MOD;
    cout<<cate[(n*(n-1)/2-s)/2];
    return 0;
}