Analysis: Loop Invariant Computation

i := 0;

while i <= m do

( j := 0 ;

while j <= n do

( t1 := i * (n +1) + j ;

ta := Base(a) + t1 ;

Cont(ta):=Cont(Base(b)+t1) + Cont(Base(c)+t1);

j := j + 1;

);

i := i + 1);