var fi,fo:text;
    p,n,i,a,b,max,ct:longint;
    sol:array[1..20] of byte;
    nr:int64;
function valid:boolean;
begin
  nr:=0;
  for i:=1 to p do
    nr:=nr*10+sol[i];

  if (nr<>0)and(nr mod a=0)and(nr mod b=0) then valid:=true
     else begin valid:=false; nr:=0; end;
end;
procedure back(k:integer);
var i,j,ok:integer;
begin
  ok:=0;
  if (k=p+1) then
   if valid=true then
     begin
       writeln(fo,nr);
       close(fo);
       halt; end
  else
   else
    for i:=0 to n-1 do
      begin
        sol[k]:=i;
        back(k+1);
      end;
end;
procedure solv;
begin
  p:=20;
  back(1);
end;
begin
  assign(fi,'multiplu.in'); reset(fi);
  assign(fo,'multiplu.out'); rewrite(fo);
  read(fi,a,b);
  close(fi);
  n:=2;
  if a>b then max:=a
         else max:=b;
  while max<>0 do
    begin
      inc(ct);
      max:=max div 10; end;
  solv;
end.