TRONMANG PASCAL

const oo=1000000000;
var a,b,c:array[1..1000000] of longint;
      m,n,i,j,k,f:longint;
procedure nhap;
var i:longint;
begin
    readln(n,m);
    for i:=1 to n do readln(a[i]);
    for i:=1 to m do readln(b[i]);
end;
procedure solve;
var i,j,k:longint;
begin
    i:=1;j:=1;a[n+1]:=oo;b[m+1]:=oo;
    for k:=1 to n+m do
    begin
        if a[i]<b[j] then
        begin
           c[k]:=a[i]; inc(i);
        end
        else
        begin
            c[k]:=b[j];inc(j);
        end;
    end;
end;
 
procedure xuat;
begin
    for i:=1 to  n+m do writeln(c[i],' ');
end;
 
begin
    assign(input, 'TRONMANG.inp');reset(input);
    assign(output, 'TRONMANG.out');rewrite(output);
    nhap;
    solve;
    xuat;
end.