const prim=194767;
      maxs=32640;
var f:text;
    s:longint;
    n,i,j:integer;
type vect=array[0..maxs] of longint;
var a,c:vect;

begin
assign(f,'1-sir.in'); reset(f);
readln(f,n,s);
close(f);
assign(f,'1-sir.out'); rewrite(f);
if (s>(n*(n-1)div 2)) or (s<-(n*(n-1))div 2) then writeln(f,0) else
begin
a[0]:=1;
for i:=1 to n-1 do
 begin
 for j:=0 to ((i+1)*i) div 2 do
  begin
  c[j]:=0;
  if j-i<=((i-1)*(i))div 2 then c[j]:=(c[j]+a[abs(j-i)]) mod prim;
  if j+i<=((i-1)*(i))div 2 then c[j]:=(c[j]+a[j+i]) mod prim;
  end;
  a:=c;
 end;

writeln(f,c[s]);
end;
close(f);
end.