#include<fstream>
#include<cmath>
#define maxs 35000
#define mod 194767
using namespace std;
int dp[2][maxs],n,s,l=1,t;

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

int main(){
    cin>>n>>s;
    dp[0][1]=1;
    for(int i=3;i<=n; i++){
      t=i*(i-1)/2;
      for(int k=0; k<=t; k++)
        dp[l][k]=(dp[l^1][(int)abs(k-(i-1))]+dp[l^1][k+i-1])%mod;
      l^=1;
    }
    cout<<dp[l^1][s];
    return 0;
}