#include <iostream>
#include <string.h>
#include <random>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <iomanip>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <valarray>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<string, string> pss;
typedef pair<int, char> pic;
typedef pair<pii, int> piii;
typedef pair<double, double> pdd;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ull, ull> pull;
typedef complex<double> cd;
//#define max(n, m) ((n>m)?n:m)
//#define min(n, m) ((n<m)?n:m)
#define f first
#define s second
#define input() ios_base::sync_with_stdio(0);cin.tie(0);

ifstream fin("1-sir.in");
ofstream fout("1-sir.out");

int mod = 194767;
int dp[66000];
int main()
{
    int i, j, n, m;
    fin >> n >> m;
    dp[0] = 1;
    if(m > n*(n-1)/2 || m < -(n*(n-1)/2))
    {
        fout << "0\n";
        return 0;
    }
    for(i = 1; i < n; i ++)
        for(j = i*(i-1); j >= 0; j --)
            dp[j+i*2] = (dp[j+i*2] + dp[j]) % mod;
    fout << dp[m+n*(n-1)/2] << "\n";
}