function isPrime(n: integer): boolean;
var
  d: integer;
begin
  d := 2;
  while (d <= Round(Sqrt(n))) and (n mod d <> 0) do d += 1;
  isPrime := d > Round(Sqrt(n))
end;

begin
  var m := 5;
  var n := 5;
  var a := MatrRandom(m, n, 0, 100);
  a.Println;
  for var i := 0 to m - 1 do
    for var j := 0 to n - 1 do
      if (i + j < m - 1) and isPrime(a[i, j]) then
        Print(a[i, j])
end.