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

int main() {
    int n, m; cin >> n >> m;
    vector< vector<long long> > a(m+2, vector<long long>(m+2, 0)), count(m+2, vector<long long>(m+2, 0));
    count = a;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> a[i+1][j+1];
            a[i+1][j+1] += a[i+1][j];
        }
    }
    for (int i = 0; i <= m; ++i) {
        for (int j = 0; j <= m; ++j) {
            a[i+1][j+1] += a[i][j+1];
        }
    }
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < m; ++j) {
            for (int u = i+1; u <= m; ++u) {
                for (int v = j+1; v <= m; ++v) {
                    if (a[i][j] + a[u][v] - a[i][v] - a[u][j] == 0) {
                        count[i+1][j+1]++; count[u+1][v+1]++;
                        count[i+1][v+1]--; count[u+1][j+1]--;
                    }
                }
            }
        }
    }
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < m; ++j) {
            count[i+1][j+1] += count[i+1][j];
        }
    }
    for (int i = 0; i <= m; ++i) {
        for (int j = 0; j <= m; ++j) {
            count[i+1][j+1] += count[i][j+1];
        }
    }
    for (int i = 0; i < n; i++) {
        int p, q; cin >> p >> q;
        cout << count[p][q] << endl;
    }
    return 0;
}