import sys
input = sys.stdin.readline

def idx(i, j, m):
    return i * (m + 2) + j

n, m = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(m)]

# Flattened 1D array for S
S = [0] * ((m + 2) * (m + 2))

# Compute prefix sums
for i in range(m):
    for j in range(m):
        S[idx(i, j, m)] = A[i][j]

for i in range(m):
    for j in range(1, m):
        S[idx(i, j, m)] += S[idx(i, j - 1, m)]

for i in range(1, m):
    for j in range(m):
        S[idx(i, j, m)] += S[idx(i - 1, j, m)]

def rectsum(x, y, z, w, m):
    return (
        S[idx(z, w, m)]
        - (S[idx(z, y - 1, m)] if y > 0 else 0)
        - (S[idx(x - 1, w, m)] if x > 0 else 0)
        + (S[idx(x - 1, y - 1, m)] if x > 0 and y > 0 else 0)
    )

# Flattened 1D array for LS
LS = [0] * ((m + 2) * (m + 2))

# Compute LS updates
for i in range(m):
    for j in range(i, m):
        for k in range(m):
            for l in range(k, m):
                if rectsum(i, k, j, l, m) == 0:
                    LS[idx(i, k, m)] += 1
                    LS[idx(i, l + 1, m)] -= 1
                    LS[idx(j + 1, k, m)] -= 1
                    LS[idx(j + 1, l + 1, m)] += 1

# Apply prefix sums on LS
for i in range(1, m + 2):
    for j in range(m + 2):
        LS[idx(i, j, m)] += LS[idx(i - 1, j, m)]

for i in range(m + 2):
    for j in range(1, m + 2):
        LS[idx(i, j, m)] += LS[idx(i, j - 1, m)]

# Answer queries
for _ in range(n):
    x, y = map(int, input().split())
    print(LS[idx(x - 1, y - 1, m)])