#include <bits/stdc++.h>
using ll = long long;
constexpr int MAX = 130;
ll A[MAX + 1][MAX + 1];
ll B[MAX + 2][MAX + 2];
int main()
{
    int N, M;
    std::cin >> N >> M;
    for (int i = 1; i <= M; i++) {
        for (int j = 1; j <= M; j++) { std::cin >> A[i][j]; }
    }
    for (int i = 1; i <= M; i++) {
        for (int j = 2; j <= M; j++) { A[i][j] += A[i][j - 1]; }
    }
    for (int i = 2; i <= M; i++) {
        for (int j = 1; j <= M; j++) { A[i][j] += A[i - 1][j]; }
    }
    for (int i = 1; i <= M; i++) {
        for (int j = 1; j <= M; j++) {
            for (int k = i; k <= M; k++) {
                for (int l = j; l <= M; l++) {
                    if (A[k][l] - A[k][j - 1] - A[i - 1][l] + A[i - 1][j - 1] == 0) { B[i][j]++, B[k + 1][j]--, B[i][l + 1]--, B[k + 1][l + 1]++; }
                }
            }
        }
    }
    for (int i = 1; i <= M; i++) {
        for (int j = 2; j <= M; j++) { B[i][j] += B[i][j - 1]; }
    }
    for (int i = 2; i <= M; i++) {
        for (int j = 1; j <= M; j++) { B[i][j] += B[i - 1][j]; }
    }
    for (int i = 0, y, x; i < N; i++) { std::cin >> y >> x, std::cout << B[y][x] << std::endl; }
    return 0;
}