Слияние массивов в один упорядоченный массив

Program xa;
var
 a,b,c:array[1..100] of integer;
 d:array[1..300] of integer;
 i,k,l, m,n,h,de:integer;
 p:array[1..3] of boolean;
begin
 repeat
  Writeln('BBedute kolu4ectBo eleMeHToB B 1-om MaccuBe');
  readln(m);
  Writeln('BBedute cam MaccuB');
  for i:=1 to m do
  begin
   Write('A[' ,i, ']=');
   readln(a[i]);
  end;
  writeln;
  Writeln('BBedute kolu4ectBo eleMeHToB B 2-om MaccuBe');
  readln(n);
  Writeln('BBedute cam MaccuB');
  for k:=1 to n do
  begin
   Write('b[' ,k, ']=');
   readln(b[k]);
  end;
  writeln;
  Writeln('BBedute kolu4ectBo eleMeHToB B 3-em MaccuBe');
  readln(h);
  Writeln('BBedute cam MaccuB');
  for l:=1 to h do
  begin
   Write('c[' ,l, ']=');
   readln(c[l]);
  end;
  writeln;
  for i:=1 to 3 do
   p[i]:=true;
  i:=1;
  k:=1;
  l:=1;
  while ((i<=m) or (k<=n) or (l<=h)) and (p[1] and p[2] and p[3]) do
  begin
   if (a[i]>a[i+1]) and (i<m) then
    p[1]:=false
  else
   inc(i);
  if (b[k]>b[k+1]) and (k<n) then
    p[2]:=false
  else
   inc(k);
  if (c[l]>c[l+1]) and (l<h) then
    p[3]:=false
  else
   inc(l)
  end;
 until p[1] and p[2] and p[3];
 Writeln;
 Writeln('MaccuBbl do Clu9Hu9');
 for i:=1 to m do
  Write(a[i], ' ');
 Writeln;
 for i:=1 to n do
  Write(b[i], ' ');
 Writeln;
 for i:=1 to h do
  Write(c[i], ' ');
 i:=1;
 k:=1;
 l:=1;
 de:=1;
 while (i<=m) or (k<=n) or (l<=h) do
 begin
  if (i<=m) and (k<=n) and (l<=h) then
  begin
   if a[i]<b[k] then
    if a[i]<c[l] then
    begin
     d[de]:=a[i];
     inc(de);
     inc(i)
    end
    else
    begin
     d[de]:=c[l];
     inc(de);
     inc(l)
    end
   else
    if b[k]<c[l] then
    begin
     d[de]:=b[k];
     inc(de);
     inc(k)
    end
    else
     if c[l]<b[k] then
     begin
      d[de]:=c[l];
      inc(de);
      inc(l)
     end
     else
     begin
      d[de]:=a[i];
      inc(de);
      inc(i)
     end;
  end
  else
   if (i<=m) and (k<=n) and (l>h) then
   begin
    if a[i]<b[k] then
    begin
     d[de]:=a[i];
     inc(de);
     inc(i)
    end
    else
     if b[k]>a[i] then
     begin
      d[de]:=b[k];
      inc(de);
      inc(k)
     end
     else
     begin
      d[de]:=a[i];
      inc(de);
      inc(i)
     end
   end
   else
    if (i<=m) and (k>n) and (l<=h) then
    begin
     if a[i]<c[l] then
     begin
      d[de]:=a[i];
      inc(de);
      inc(i)
     end
     else
      if c[l]>a[i] then
      begin
       d[de]:=c[l];
       inc(de);
       inc(l)
      end
      else
      begin
       d[de]:=a[i];
       inc(de);
       inc(i)
      end
    end
    else
     if (i>m) and (k<=n) and (l<=h) then
     begin
      if b[k]<c[l] then
      begin
       d[de]:=b[k];
       inc(de);
       inc(k)
      end
      else
       if c[l]>b[k] then
       begin
        d[de]:=c[l];
        inc(de);
        inc(l)
       end
       else
       begin
        d[de]:=b[k];
        inc(de);
        inc(k)
       end
     end
     else
      if (i>m) and (k<=n) and (l>h) then
      begin
       d[de]:=b[k];
       inc(k);
       inc(de)
      end
      else
       if (i>m) and (k>n) and (l<=h) then
       begin
        d[de]:=c[l];
        inc(l);
        inc(de)
       end
       else
        if (i<=m) and (k>n) and (l>h) then
        begin
         d[de]:=a[i];
         inc(i);
         inc(de)
        end
 end;
 Writeln;
 Writeln;
 Writeln('noLy4uBLLieUc9 maCCub');
 for i:=1 to de-1 do
  Write(d[i], ' ');
 readln;
end.