Задача по двумерному массиву и поиску произведения элементов столбца

const a=-13; b=15;
var
  m, n, i, j, t: Integer;
  u: array [0..99,0..99] of Integer;
  v: array [0..High(u[Low(u)]) of Integer;
begin
  repeat
    Write('m n [1..',High(v)+1,']: '); ReadLn(n,m);
  until (m in [1..High(u)+1]) and (n in [1..High(v)+1]);
  Randomize;
  for j:=0 to n-1 do v[j]:=1;
  for i:=0 to m-1 do begin
    for j:=0 to n-1 do begin
      u[i,j]:=a+Random(b-a+1); Write(u[i,j]:2);
      v[j]:=(v[j] * u[i,j]) and 1;
    end; WriteLn;
  end; WriteLn;
  for j:=0 to n-1 do begin
    v[j]:=1-v[j]; Write(v[j]:2)
  end;
end.

Program Lab5N4;
 
uses crt;
 
var
i,j,M,N,code,codee,sum,z:integer;
s,s1:string;
a:array [1..100,1..100] of integer;
b:array [1..100] of integer;
 
begin
randomize;
clrscr;
repeat
write('Кол-во строк: ');
readln(s);
val(s,N,code);
write('Кол-во столбцов: ');
readln(s1);
val(s1,M,codee);
if (code<>0) or (codee<>0) then
writeln('Ошибка. Это не число.');
if (N<1) or (N>100) or (M<1) or (M>100) then
writeln('Ошибка.');
until (code=0) and (N>0) and (N<101) and (codee=0) and (M>0) and (M<100);
writeln;
 
{Создание матрицы}
for i:=1 to N do
    for j:=1 to M do
    begin
    a[i,j]:=-13+random(29);
    end;
 
{Ее вывод}
writeln('Матрица :');
writeln;
 
for i:=1 to N do begin
    for j:=1 to M do
    write(a[i,j]:4);
    writeln;
    end;
 
writeln;
writeln('Суммы столбцов: ');
writeln;
 
 
{Нахождение произведения элементов столбцов и их вывод}
for j:=1 to M do begin
    sum:=0;
    for i:=1 to N do
        sum:=sum+a[i,j];
        write(sum,'; ');
        end;
 
 
 
readkey;
end.

const a=-13; b=15; W=4;
var
  m, n, i, j, t: Integer;
  u: array [0..99,0..99] of Integer;
  v: array [0..High(u[Low(u)])] of Integer;
begin
  repeat{$I-}
    Write('m n [1..',High(v)+1,']: '); ReadLn(m,n);{$I+}
  until (IOResult=0) and (m in [1..High(u)+1]) and (n in [1..High(v)+1]);
  Randomize;
  for j:=0 to n-1 do v[j]:=1;
  for i:=0 to m-1 do begin
    for j:=0 to n-1 do begin
      u[i,j]:=a+Random(b-a+1); Write(u[i,j]:W);
      v[j]:=(v[j] * u[i,j]) and 1;
    end; WriteLn;
  end; WriteLn;
  for j:=0 to n-1 do begin
    v[j]:=1-v[j]; Write(v[j]:W);
  end;
end.

      v[j]:=v[j] and u[i,j];