const modulo = 1999999973;

var n,p:longint;
    f:text;

function hatvany(n,p:longint):longint;
var k:longint;
begin
 if p=0 then hatvany:=1
 else begin
  k:=hatvany(n,p div 2);
  if (p mod 2 = 0) then hatvany:=k*k mod modulo
  else hatvany:=(k*k mod modulo)*n mod modulo;
 end;
end;

begin
assign(f,'lgput.in');
reset(f);
read(f,n,p);
close(f);

assign(f,'lgput.out');
rewrite(f);
write(f,hatvany(n,p));
close(f);
end.