Упорядочить по неубыванию каждую строку матрицы

program prog;
uses crt;
var mas:array[1..15] of word;
l,h,c:integer;
procedure QuickSort(var A: Array of word; L, R: Integer);
var
I, J: Integer;
P, T: Word;
begin
repeat
I := L;
J := R;
P := A[(L + R) shr 1];
repeat
while A[I]< P do
Inc(I);
while A[J]> P do
Dec(J);
if I <= J then
begin
T := A[I];
A[I] := A[J];
A[J] := T;
Inc(I);
Dec(J);
end;
until I > J;
if L < J then
QuickSort(A, L, J);
L := I;
until I >= R;
end;
begin
writeln('vvesti mas[l]');
readln(mas[l]);
QuickSort(mas[l],h,c);
readln;
end.

uses crt;
var str:string[30];
k,i,n,m:integer;
Fl:boolean;
begin
readln(str);
n:=length(str);
 
while m<n do
begin
Fl:=true;
for i:=1 to n div 2 do
if str[i]<> str[n-i+1] then
Fl:=false;
if Fl then
writeln ('Palindrom')
else
writeln ('Ne palindrom');
m:=m+1;
end;
end.

uses crt;
var str:string[30];
k,i,n,m:integer;
Fl:boolean;
begin
readln(str);
n:=length(str);
while m<n do
begin
Fl:=true;
for i:=1 to n div 2 do
if str[i]<> str[n-i+1] then
Fl:=false;
begin
if Fl then
writeln ('Palindrom')
else
writeln ('Ne palindrom');
m:=m+1;
end;
readln;
end;
end.