#include <bits/stdc++.h>
#define maxN 260
#define MOD 194767
using namespace std;
int s, n, i, j, dp[maxN][(maxN-1)*maxN/2];
void modulo(int &x,int y)
{
    x += y;
    if(x >= MOD) x -= MOD;
}
int main()
{
    freopen("1-sir.in", "r", stdin);
    freopen("1-sir.out", "w", stdout);
    scanf("%d %d", &n, &s);
    dp[1][0] = 1;
    for(i = 2; i <= n; i++)
    {
        for(j = 0; j <= (i-1)*i/2; j++)
            {
                dp[i%2][j] = (dp[(i-1)%2][abs(j+1-i)]);
                modulo(dp[i%2][j], dp[(i-1)%2][abs(j-1+i)]);
            }
            memset(dp[(i-1)%2], 0, sizeof(dp[(i-1)%2]));
    }
    printf("%d", dp[n%2][s]);
    return 0;
}