упорядовачение двухмерново масива

Const  MaxX = 3;  MaxY = 3;
Type Element=Integer;
Var
  T : Array [1..MaxX, 1..MaxY] of Element;
  X1, Y1, X2, Y2 : Integer;
  L1, L2 : Integer; {Poriadkoviye nomera elementov}
  Tmp : Element;
Begin
  WriteLn;
  WriteLn('---------');
  WriteLn ('T[1,1] .. T[',MaxX, ',', MaxY, '] =');
  (******Vvod znacheniy*******)
  For Y1 := 1 to MaxY do
    For X1 := 1 to MaxX do Read (T[X1,Y1]);

  (*******Sortirovka**********)
  For L1 := 1 to MaxX*MaxY do Begin {Poriadkoviy nomer odnogo elementa}
    X1 := (L1-1) mod MaxX + 1; {Rasschet ego koordinati X}
    Y1 := (L1-1) div MaxX + 1; {Rasschet ego koordinati Y}
    For L2 := L1+1 to MaxX*MaxY do Begin {Poriadkoviy nomer drugogo elementa}
      X2 := (L2-1) mod MaxX + 1; {Rasschet ego koordinati X}
      Y2 := (L2-1) div MaxX + 1; {Rasschet ego koordinati Y}
      If T[X1, Y1] > T[X2, Y2] then Begin  {Meniayem mestami}
        Tmp := T[X1, Y1];
        T[X1, Y1] := T[X2, Y2];
        T[X2, Y2] := Tmp;
      End;
    End;
  End;

  (********Vivod rezultata**********)
  WriteLn ('Result:');
  For Y1 := 1 to MaxY do Begin
    For X1 := 1 to MaxX do Begin
      Write (T[X1, Y1], #32);
    End;
    WriteLn;
  End;

End.