const
 n = 10;
 m = 10;
type
 t_row = array[1..n] of integer;
 t_matr = array[1..m] of t_row;

procedure max(var a:t_row;n:integer);
var
 i,mi,d:integer;
begin
 mi := 1;
 for i := 2 to n do
  if a[mi] < a[i] then
   mi := i;
 d := a[1];
 a[1] := a[mi];
 a[mi] := a[1];
end;
procedure insert_sort(var a:t_matr;n:integer);
var
 i,j:integer;
 d:t_row;
begin
 for i := 2 to n do
 begin
  j := i-1;
  while (j >= 1) and (a[j+1][1] < a[j][1]) do
  begin
   d := a[j+1];
   a[j+1] := a[j];
   a[j] := d;
   j := j - 1;
  end;
 end;
end;
Begin
End.