#include <fstream>
#include <vector>
#include <deque>
#include <cstring>
#include <queue>
#include <limits.h>
#include <string>

#define MOD 194767

using namespace std;
ifstream cin("1-sir.in") ;
ofstream cout("1-sir.out") ;

int recur(int start, int n, int s)
{

    if(n == 1)
    {

        if(start == s)return 1 ;

        return 0 ;

    }

    return recur(start + 1, n - 1, s - start - 1) + recur(start - 1, n - 1, s - start + 1) ;

}

int m[10000000] ;

int main()
{

    int n ;

    int s ;

    cin >> n >> s ;

    m[1] = 1 ;

    int prev = 1 ;

    for(int f = 1 ; f < n ; f ++)
    {

        for(int e = prev ; e ; e --)
            m[e + 2 * f] += m[e], m[e + 2 * f] %= MOD ;

        prev += 2 * f ;

    }

    /// putem folosi pentru

    cout << m[s + n * (n - 1) / 2 + 1] ;

    return 0 ;

}