Take this general formula: addr$($matrix$[$i$,$j$])=$p$+($i$$ps$)+($j$$es$)$

for a $0-$origin array where es $=$ element size, ps $=$ pointer size, matrix is the name of array, I is row and j is column to be accessed, and the base address of the array is p$.$ Modify it$,$ but allow for the lower bound of each dimension to be other than $0-$origin. So instead of array$[0..$up$1$; $0..$up$2],$ the bounds would be array$[$lb$1..$up$1$;lb$2..$up$2].$

from there, assuming a matrix declaration var aMatrix : array $[4...11$; $3...12]$ and p $=2000,$ ps $=2,$ es $=4,$ get the address of aMatrix $[6,7]$