Program kperm;
const md=666013;
 var n,k,r,c,i,p:longint;
     fi,fo:text;
function fact(nr:longint):longint;
begin
 p:=1;
  for i:=1 to nr do p:=p*i mod md;
 fact:=p;
end;
function pow(a,b:longint):longint;
begin
 p:=1;
  for i:=1 to b do p:=p*a mod md;
 pow:=p;
end;
begin
 assign(fi,'kperm.in');
  assign(fo,'kperm.out');
 reset(fi); rewrite(fo); readln(fi,n,k);
  c:=n div k; r:=n mod k;
 if k mod 2=0 then write(fo,'0')
                   else write(fo,(fact(r)*fact(k-r) mod md)*(pow(fact(c+1),r)*pow(fact(c),k-r) mod md) mod md);
 close(fo);
end.