只求穷举的55分

var a,b,c,d,i,m,n:longint;p,q:array[1..15000]of longint;
    f:array[1..15000,1..4]of longint;
procedure qsort(l,r: longint);
var
i,j,x,y: longint;
begin
i:=l;j:=r;x:=p[(l+r) div 2];
repeat
while p[i]<x do inc(i);
while x<p[j] do dec(j);
if not(i>j) then
begin
y:=p[i];p[i]:=p[j];p[j]:=y;
y:=q[i];q[i]:=q[j];q[j]:=y;
inc(i);
j:=j-1;
end;
until i>j;
if l<j then qsort(l,j);
if i<r then qsort(i,r);
end;
begin
fillchar(f,sizeof(f),0);
readln(m,n);
for i:=1 to n do begin readln(p[i]);q[i]:=i;end;
qsort(1,n);
for a:=1 to n-3 do
for b:=a+1 to n-2 do
for c:=b+1 to n-1 do
for d:=c+1 to n do
if ((p[b]-p[a])=2*(p[d]-p[c]))and((p[b]-p[a])<(p[c]-p[b])/3) then
begin
inc(f[q[a],1]);
inc(f[q[b],2]);
inc(f[q[c],3]);
inc(f[q[d],4]);
end;
for i:=1 to n do
writeln(f[i,1],' ',f[i,2],' ',f[i,3],' ',f[i,4]);
end.
为什么一个过不了，样例好没用啊