dp.py

def preprocess(A):
    return A

def solution(mat, i, j, m, n):
    # write your solution here
    sum1 = 0
    for ix in range(len(mat)):
        row = mat[ix]
        for jx in range(len(mat)):
            column = row[jx]
            if (i <= ix < i + n) and (j <= jx < j + m):
                sum1 += column
                print(f"Adding {column} from ({ix},{jx}) to sum. Sum = {sum1}")

    return sum1


# test run 1
A = [[2, 8, 3, 2, 7],
     [10, 6, 4, 8, 3],
     [2, 7, 3, 7, 8],
     [8, 5, 10, 9, 2],
     [2, 6, 10, 4, 9]]
mat = preprocess(A)

assert 22 == solution(mat, 1, 2, 2, 2)  # should be 22
print("")  # space
# query1
assert 27 == solution(mat, 0, 2, 3, 2)  # should be 27