Сортировка слиянием - исправить код

Program faili;
uses crt;
const
  N = 10;
  M = 15;
type massive = array [1 .. N] of real;
     mymas = array [1..M] of real;
var
d1: massive;
d2:mymas;
i,x:integer;
procedure gen(k:integer; var t:massive);
var i:integer;
begin
for i:=1 to k do
t[i]:=random(10);
end;
procedure print(k:integer; t:massive);
var i:integer;  t1:text;
begin
assign (t1,'d1.txt');
rewrite (t1);
for i:=1 to k do
write (t1,d1[i]:4:1,' ');
close (t1);
end;
procedure gen1(k: integer; var t:mymas);
var i:integer;
begin
for i:=1 to k do
t[i]:=random(10);
end;
procedure print1(k:integer; t:mymas);
var i:integer;  t2:text;
begin
assign (t2,'d2.txt');
rewrite (t2);
for i:=1 to k do
write (t2,d2[i]:4:1,' ');
close(t2);
end;
procedure chten(k:integer; t1:text);
var i:integer; d1:massive;
begin
assign(t1,'d1.txt');
reset(t1);
for i:= 1 to k do
begin
read (t1,d1[i]);
write (d1[i]:6:1);
end;
writeln;
close(t1);
end;
procedure chten1(k:integer; t2:text);
var i:integer; d2:mymas;
begin
assign(t2,'d2.txt');
reset(t2);
for i:= 1 to k do
begin
read (t2,d2[i]);
write (d2[i]:6:1);
end;
writeln;
close(t2);
end;
procedure Sliv(var a:mas;p,q : integer);
var r,i,j,k : integer;
    b:mas;
begin
 r:=(p+q) div 2;
 i:=p;
 j:=r+1;
 for k:=p to q do
 if (i<=r) and ((j>q) or (a[i]<a[j])) then
   begin
   b[k]:=a[i];
   i:=i+1;
  end
 else
  begin
   b[k]:=a[j];
   j:=j+1;
  end ;
 for k:=p to q do
 a[k]:=b[k];
end;
procedure Sort(var a:massive; b:mymass; p,q : integer);
begin
 if p<q then
 begin
  Sort(a,p,(p+q) div 2);
  Sort(a,(p+q) div 2 + 1,q);
  Sliv(a,p,q);
 end;
end;
begin
clrscr;
randomize;
gen (N,d1);
print (N,d1);
gen1 (M,d2);
print1(M,d2);
writeln ('otsortirovanniy massiv');
readln;
sort(d1,d2,N,M);
readln;
end.