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

int n,s,dp[2][256*256];

int abs(int x)
{
    if (x<0)
        return x*(-1);
    return x;
}

int main()
{
    freopen("1-sir.in","r",stdin);
    freopen("1-sir.out","w",stdout);
    scanf("%d%d",&n,&s);
    if (s>n*(n-1))
        {
            printf("0");
            return 0;
        }
    dp[0][0]=1;
    int l=0;
    for (int i=2;i<=n;++i)
    {
        l^=1;
        for (int j=0;j<=i*(i-1);++j)
        {
            dp[l][j]=dp[l^1][abs(j-(i-1))]%mod+dp[l^1][abs(j+(i-1))]%mod;
            dp[l][j]%=mod;
        }
    }
    printf("%d",dp[l][s]);
    return 0;
}