#!/usr/bin/env python3
# %%
import numpy as np
stdin = open(0)

# %%
data = np.fromstring(stdin.read(), np.int64, sep=' ')

# %%
N, M = data[:2]
A = data[2: 2 + M * M].reshape(M, M)
XY = data[-N - N:] - 1


# %%
def zerosum_1D(A, i):
    """count zerosum ranges including A[i]"""
    n = len(A)
    Acum = np.zeros(n + 1, np.int64)
    Acum[1:] = A.cumsum()
    R = Acum[i + 1:]
    L = Acum[: i + 1]
    L.sort()
    R.sort()
    cnt = np.searchsorted(L, R, 'right') - np.searchsorted(L, R, 'left')
    return cnt.sum()


# %%
Acum = A.cumsum(axis=0)


# %%
def solve(x, y):
    ret = 0
    for i in range(x + 1):
        for j in range(x, M):
            B = Acum[j] - Acum[i] + A[i]
            ret += zerosum_1D(B, y)
    return ret


# %%
for x, y in XY.reshape(-1, 2):
    print(solve(x, y))