const modulo=1999999973;
var n,p,rs:longint;

begin
assign(input,'lgput.in');
assign(output,'lgput.out');
reset(input);
rewrite(output);
 read(n); readln(p);
        rs:=1;
   while p>0 do
    begin
     if p mod 2=0 then begin n:=((n mod modulo)*(n mod modulo)) mod modulo; p:=p div 2; end
                  else begin rs:=((rs mod modulo)*n)) mod modulo; dec(p); end;
    end;
     writeln(rs);
close(input);
close(output);
{Totusi este trist in lume}
end.