#include <stdio.h>
#include <algorithm>

using namespace std;

long v[3][66000], n, i, j, k, s, o;


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