一道简单的FREE PASCAL 希望大牛来解答

一道简单的FREE PASCAL 希望大牛来解答
A城是矩形平原,B君在上面修建一些建筑,为了规划方便,他将矩形划分成N*M格.
有部分神庙分布在格子内,建筑选址时必须避开神庙.新建的建筑物有P种规格,每种建筑物都是正方形,占地为Ti*Ti（1

简单?
program building;
var n,m,p,i,j,c,k:longint;s:array [1..maxsize] of integer;a:array [1..maxsize] of array [1..maxsize] of integer;
begin
assign(input,'building.in');
assign(output,'building.out');
reset(input);
rewrite(output);
readln(n,m,p);
for i=1 to n
begin
for j=1 to m do read(a[m][n]);
readln;
end;
for i=1 to p do readln(s[p]);
for i=1 to p
begin
for j=1 to m-s[p]+1
begin
for k=1 to n-s[p]+1
唉,懒得写了!