program osszefuttatas;
uses tomb_io, tomb_rend;
var  a,b,c:tomb;
     n,m,i,j,k:byte;
begin
  beolvas(a,n,'a');
  beolvas(b,m,'b');
  kiir(a,n,'a');
  kiir(b,m,'b');
  minimum_rendezes(a, n);
  kiir(a,n,'a rendezett a');
  minimum_rendezes(b, m);
  kiir(b,m,'a rendezett b');
  i:=1;
  j:=1;
  k:=0;
  while (i <= n) and (j <= m) do
  begin
    k:= k+1;
    if a[i] < b[j] then
    begin
      c[k]:= a[i];
      i:= i+1;
    end;
    if a[i] = b[j] then
    begin
      c[k]:= a[i];
      i:= i+1;
      j:= j+1;
    end;
    if a[i] > b[j] then
    begin
      c[k]:= b[j];
      j:= j+1;
    end;
  end;
  while i<= n do
  begin
    k:=k+1;
    c[k]:= a[i];
    i:= i+1;
  end;
  while j<= m do
  begin
    k:=k+1;
    c[k]:= b[j];
    j:= j+1;
  end;
  kiir(c,k,'c');
  readln;
end.