program bing;
var
 f1,f2:text;
 n,p,i,j:longint;
 a:array[1..500,1..300] of longint;
begin
 assign(f1,'subway.in');reset(f1);
 assign(f2,'subway.out');rewrite(f2);
 readln(f1,n,p);
 fillchar(a,sizeof(a),0);
 for i:=1 to  p do
 begin
  a[1,i]:=1;
  a[i,i]:=1;
  for j:=1 to p do a[i,i]:=a[i,i]*j mod 4096;
 end;
 for i:=1 to n do
 a[i,1]:=1;
 for i:=2 to n do
 for j:=2 to p do
 if a[i,j]=0 then a[i,j]:=a[i-1,j]*2 mod 4096;
 write(f2,a[n,p]);
 close(f1);close(f2);
end.