val N:ℕ;
val M:ℕ;
axiom notZero ⇔ N > 0;
  
type int   = ℤ[-N,N];
type elem  = ℤ[-M,M];
type array = Array[N,elem];

proc maximumElement(a:array): elem
{
  var m:elem ≔ -1;
  for var i:int ≔ 0; i < N; i ≔ i+1 do
  {
    if a[i] > m then m ≔ a[i];
  }
  return m;
}

proc maximumIndex(a:array): int
{
  var p:int ≔ 0;
  var m:elem ≔ 0;
  for var i:int ≔ 1; i < N; i ≔ i+1 do
  {
    if a[i] > m then 
    {
      p ≔ i;
      m ≔ a[p];
    }
  }
  return p;
}