#include <bits/stdc++.h>
#define DIM 260*260
#define mod 194767
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
int n,s,i,j,smax,d[DIM];
int main() {
    fin>>n>>s;
    smax=n*(n-1)/2;
    s=abs(s);
    if (s>smax) {
        fout<<"0";
        return 0;
    }
    //d[i][j]=cate 1-siruri cu suma j si i termeni
    //d[i][j]=d[i-1][j-(i-1)]+d[i-1][j+(i-1)]
    //facem rucsac si tinem pe o singura linie
    d[0]=1;
    for (i=1;i<n;i++) {
        for (j=s;j-i>=0;j--) {
            d[j]+=d[j-i];
            d[j]%=mod;
        }
    }
    fout<<d[s];
    return 0;
}