#include <cstdio>
#include <algorithm>

#define MOD 194767

using namespace std;

int dp[2][140000];

int main ()
{
    freopen ("1-sir.in", "r", stdin);
    freopen ("1-sir.out", "w", stdout);

    int n, sum;
    scanf ("%d %d", &n, &sum);
    sum += 70000;

    int mi = -n * (n + 1) / 2 + 70000;
    int ma = n * (n + 1) / 2 + 70000;

    if (sum > ma || sum < mi)
    {
        printf ("0\n");
        return 0;
    }

    dp[0][70000] = 1;

    for (int i = 1; i < n; ++i)
    {
        for (int j = mi; j <= ma; ++j)
        {
            if (j + i <= ma)
            {
                dp[1][j + i] += dp[0][j];
                dp[1][j + i] -= (dp[1][j + i] >= MOD) * MOD;
                dp[1][j + i] += (dp[1][j + i] < 0) * MOD;
            }

            if (j - i >= mi)
            {
                dp[1][j - i] += dp[0][j];
                dp[1][j - i] -= (dp[1][j - i] >= MOD) * MOD;
                dp[1][j - i] += (dp[1][j - i] < 0) * MOD;
            }

        }

        for (int j = mi; j <= ma; ++j)
        {
            dp[0][j] = dp[1][j],
            dp[1][j] = 0LL;
        }
    }

    printf ("%d\n", dp[0][sum]);

    return 0;
}