Задача на префиксные суммы матрицы

k= list(map(int, input().split()))
a=[[0 for j in range(int(k[1]))] for i in range(int(k[0]))]
for i in range(0, k[1], 1):
    p=list(map(int, input().split()))
    for j in range(0, k[0], 1):
        if k[0]==k[1]:
            if i==0 and j==0:
                a[i][j]=p[j]
            elif i==0:
                a[i][j]=p[j]+a[i][j-1]    
            else:
                if j==0:
                    a[i][j]=a[i-1][j]+p[j]
                else:
                    a[i][j]=p[j]+a[i-1][j]+a[i][j-1]-a[i-1][j-1]
        if k[0]!=k[1]:
            if j==0 and i==0:
                a[0][0]=p[j]
            if j!=0 and i==0:
                a[j][i]=p[j]+a[j-1][i]
            if i!=0 and j==0:
                a[j][i]=a[j][i-1]+p[j]
            if i!=0 and j!=0:
                a[j][i]=a[j][i-1]+a[j-1][i]-a[j-1][i-1]+p[j]
print(a)
for f in range (0, k[2], 1):
    r= list(map(int, input().split()))
    SUM=0
    if r[0]==1 and r[1]==1:
        SUM=a[r[2]-1][r[3]-1]
    elif r[0]==1 and r[1]!=1:
        SUM=a[r[2]-1][r[3]-1]-a [r[2]-1][r[1]-2]
    elif r[0]!=1 and r[1]==1:
        SUM=a[r[2]-1][r[3]-1]-a[r[1]-1][r[2]-2] 
        
    elif r[0]!=1 and r[1]!=1:
        SUM=a[r[2]-1][r[3]-1]-a[r[1]-2][r[3]-1]-a[r[2]-1][r[1]-2]+a[r[0]-2][r[1]-2]
    print(SUM)

def psum(matr,x1,y1,x2,y2):
    s=0
    for i in range(y1-1,y2):
        for j in range(x1-1,x2):
            s+=matr[i][j]
    return s
    
m=[[1,2,3,4,5,6],
   [4,5,6,7,8,9],
   [7,8,9,1,2,3],
   [0,9,8,7,6,5]]
   
print(psum(m,2,2,3,4))

n, m, k = map(int, input().split())
a = []
for i in range(n):
    a.append(list(map(int, input().split())))
b = [0] * (n + 1)
 
for i in range(n + 1):
    b[i] = [0] * (m + 1)
 
for i in range(n):
    for j in range(m):
        b[i + 1][j + 1] = a[i][j] + b[i][j + 1] + b[i + 1][j] - b[i][j]
 
x = []
for i in range(k):
    i1, j1, i2, j2 = map(int, input().split())
    c = b[i2][j2] - b[i1 - 1][j2] - b[i2][j1 - 1] + b[i1 - 1][j1 - 1]
    x.append(c)
print(*x, sep='\n')