Как сделать вывод в файл в данной ситуации?

Program generator_placement;
uses crt;
const
 n1=1000;
type
 t=array[1..n1] of integer;
var
 x,min,max:t;
 k,n:integer;
 r:longint;
 l:text;
 
 
Procedure output_p(x:t; k:integer);
var
 e:integer;
begin
//writeln('Razmeshenija elementov');
 for e:=1 to k do write(x[e]:4);
writeln
end;
 
Procedure generator_transp(x:t; k:integer;
 
var z:longint);
label 1;
var
 y,i,j,v,l:integer;
begin
 z:=1;
 for i:=1 to k do z:=z*i;
 output_p(x, k);
 y := 1;
 for y := 2 to z do
 begin
 i := 2; j := 1;
 while x[i - 1] <= x[i] do i := i + 1;
 while x[j] <= x[i] do j := j + 1;
 v := x[i]; x[i] := x[j]; x[j] := v;
 if i = 2 then goto 1;
 for l := 1 to (i - 1) div 2 do
 begin
 v := x[l]; x[l] := x[i - l]; x[i - l] := v
 end;
1: output_p(x, k)
end
end;
 
Procedure gen_comb(x,min,max:t; n,k:integer; var r:longint);
var
 i,j:integer;
 z:longint;
begin
 for j := 1 to k do
 begin
 max[j] := n - j + 1;
 min[j] := k - j + 1;
 x[j] := min[j]
end;
i := 0;
while i <= k do
begin
 generator_transp(x, k, z);
 r := r + z; i := 1;
 while (i <= k) and (x[i] = max[i]) do i:=i+1;
 if i <= k then x[i] := x[i] + 1;
 for j := i - 1 downto 1 do
 begin
 min[j] := x[j + 1] + 1; x[j] := min[j]
end
end
end;
 
begin
//assign (t,'input.txt');
//reset(t);
//read (t,a);
clrscr;
writeln;
write('Input elements n = '); readln(n);
writeln;
write('Input elements amount of elemets to choose k = ');
readln(k);
//writeln(n,k);
writeln;
gen_comb(x, min, max, n, k, r);
assign (l,'output.txt');
rewrite(l);
write(l, gen_comb );
close (l);
writeln;
writeln('Chislo vseh razmeshenij r = ', r);
readln;
end.

Procedure output_p(var l:text; x:t; k:integer) ;