#include <bits/stdc++.h>
using namespace std;

int main() {
    int64_t n, m;
    cin >> n >> m;
    vector<vector<int64_t>> arr(m, vector<int64_t>(m));
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            cin >> arr[i][j];
        }
    }
    vector<vector<int64_t>> dp(m + 1, vector<int64_t>(m + 1, 0));
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            dp[i + 1][j + 1] = arr[i][j];
        }
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            dp[i][j + 1] += dp[i][j];
        }
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            dp[i + 1][j] += dp[i][j];
        }
    }
    for (int t = 0; t < n; t++) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        int64_t ans = 0;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) {
                for (int k = i + 1; k <= m; k++) {
                    for (int puni = j + 1; puni <= m; puni++) {
                        pair<int, int> l(i, j), r(k, puni);
                        if (l.first <= x && x < r.first && l.second <= y && y < r.second) {
                            int64_t cnt = dp[r.first][r.second] - dp[l.first][r.second] - dp[r.first][l.second] + dp[l.first][l.second];
                            if (cnt == 0) {
                                ans++;
                            }
                        }
                    }
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}