PROGRAM SAVEMAN_TIMUS;
CONST
  MAXDIGIT      =       180;
  NODEDIGIT     =         8;
  MAXVALUE      =  99999999;
  MODULATOR     = 100000000;
TYPE
  BigNumber=array[1..MAXDIGIT div NODEDIGIT]of longint;

PROCEDURE INIT(var b:BigNumber);
          begin  fillchar(b,sizeof(b),0);end;

PROCEDURE ADDINT(var b:BigNumber;int:longint);
          var  i:longint; begin
          for i:=1 to MAXDIGIT div NODEDIGIT do
          begin    b[i]:=b[i]+int;    int:=b[i] div MODULATOR;
          b[i]:=b[i] mod MODULATOR;  if int=0 then      exit;  end; end;

PROCEDURE ADDBIG(var b:BigNumber;n:BigNumber);
          var  i:longint;  REST:longint;begin REST:=0;
          for i:=1 to MAXDIGIT div NODEDIGIT do  begin b[i]:=b[i]+n[i]+REST;
          REST:=b[i] div MODULATOR; b[i]:=b[i] mod MODULATOR;  end;end;

PROCEDURE MULINT(var b:BigNumber;int:longint);
          var i:longint;REST:longint;begin for i:=1 to MAXDIGIT div NODEDIGIT do
          begin b[i]:=b[i]*int+REST; REST:=b[i] div MODULATOR;b[i]:=b[i] mod MODULATOR;
          end;end;

PROCEDURE PRINTBIG(b:BigNumber);
          var k,i,l:longint; s:string;begin for i:=MAXDIGIT div NODEDIGIT downto 1 do
          if b[i]<>0 then break; write(b[i]); k:=i-1; for i:=k downto 1 do
          begin   Str(b[i]:8,s);    l:=1;   while (s[l]=' ')and(l<=8)
          do begin s[l]:='0';inc(l);end; write(s); end; end;

var
  A0,B0,A1:BigNumber;
  n,k:longint;
  i:longint;
begin
  readln(n,k);  init(a0);  init(b0);  ADDINT(b0,k-1);
  for i:=2 to n do begin
     A1:=B0;        {a(i)=b(i-1)}
     ADDBIG(b0,a0); {b(i)=b(i-1)+a(i-1)}
     MULINT(b0,k-1);{b(i)=b(i-1)*(k-1)}
     A0:=A1;        {inc(i)}
   end;
  ADDBIG(A1,B0);    {a(n)=a(n)+b(n)}
  PRINTBIG(A1);
end.

b[i]*int may be more than MaxLongInt