program _1sir;

const MODULO = 194767;

var
  nr: array[0..1, -32767..32767, -256..256] of longint;
  N, S: longint;
  i,j,k: longint;
  Sum: longint;
  cur,prev: byte;
  F: Text;

begin
  Assign(F, '1-sir.in');
  Reset(F);
  Readln(F, N, S);
  Close(F);

  FillChar(nr, sizeof(nr), 0);

  nr[1,0,0] := 1;
  for i := 2 to N do
  begin
    cur := i mod 2;
    prev := 1-cur;
    for j := -(i*(i-1) div 2) to i*(i-1) div 2 do
      for k := -i+1 to i-1 do
        nr[cur,j,k] := (nr[prev, j-k,k+1] + nr[prev,j-k,k-1]) mod MODULO;
  end;


  Sum := 0;
  for i := -N+1 to N-1 do
    Sum := (Sum + nr[cur,S,i]) mod MODULO;

  Assign(F, '1-sir.out');
  Rewrite(F);
  Writeln(F, Sum);
  Close(F);
end.