program ex(input,output);
label 100;
var i,j,k,m,n, flag:integer;
    a,b,c:array[0..10000] of integer;
begin
  read(m); read(n);
  for i:=0 to m-1 do read(a[m-1-i]);
  for i:=0 to n-1 do read(b[n-1-i]);
  for i:=0 to n-m do c[i]:=0;
  writeln('start'); readln;
  for j:=n-1 downto m-1 do begin 
    flag:=0;
    {*** to see if a can be subtracted from b[j..j-m+1] ***}
    for i:=m-1 downto 0 do 
      if b[j-m+1+i]<>a[i] then begin
        if b[j-m+1+i]<a[i] then flag:=1; goto 100
      end;  
    100:
    {*** if so, perform subtraction ***}
    if flag=0 then begin                     { *** example ** }
      c[j-m+1]:=1;                           { c      1 0 1 0 }
      for i:=0 to m-1 do begin               { b  1 1 0 1 1 0 }
        b[j-m+1+i]:=b[j-m+1+i]-a[i];         { a  1 0 1       }
        if b[j-m+1+i]<0 then begin           { b  0 0 1 1 1 0 }
          b[j-m+1+i]:=2+b[j-m+1+i];          { a      1 0 1   }
          b[j-m+1+i+1]:=b[j-m+1+i+1]-1       { b  0 0 0 1 0 0 }
        end;
      end
    end;
  end;
  for i:=0 to 9 {m-1} do write(b[i]:2);
  writeln;
  for i:=0 to 9 {n-m} do write(c[i]:2);
  writeln
end.