program cheng;
var a,b:array[1..100]of integer;
ans:array[1..400]of integer;
i,j,k,l,t:longint;
s:ansistring;
begin
assign(input,'mul.in');
assign(output,'mul.out');
reset(input);
rewrite(output);
readln(s);
k:=0;
j:=length(s);
for i:=j downto 1 do begin
k:=k+1;
val(s[i],a[k],t);
end;
readln(s);
k:=0;
l:=length(s);
for i:=l downto 1 do begin
k:=k+1;
val(s[i],b[k],t);
end;
for i:=1 to j do
for k:=1 to l do ans[i+k-1]:=ans[i+k-1]+a[i]*b[k];
for i:=1 to j+l-1 do if ans[i]>9 then begin
ans[i+1]:=(ans[i] div 10)+ans[i+1];
ans[i]:=ans[i] mod 10;
end;
k:=j+l;
while (ans[k]=0)and(k>1) do k:=k-1;
for i:=k downto 1 do write(ans[i]);
close(input);
close(output);
end.