#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

int main(){
    int n, m; cin >> n >> m;
    vector<vector<int>> a(m, vector<int>(m));
    for(auto &v: a){
        for(auto &it: v) cin >> it;
    }
    vector<int> x(n), y(n);
    for(int i = 0; i < n; i++){
        cin >> x[i] >> y[i];
        x[i]--; y[i]--;
    }

    vector<vector<ll>> b(m+1, vector<ll>(m+1, 0));
    for(int i = 0; i < m; i++){
        for(int j = 0; j < m; j++){
            b[i+1][j+1] = b[i][j+1]+b[i+1][j]-b[i][j]+a[i][j];
        }
    }

    vector<vector<int>> mem(m+1, vector<int>(m+1, 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 l = j+1; l <= m; l++){
                    if(b[k][l]-b[i][l]-b[k][j]+b[i][j] == 0){
                        mem[i][j]++;
                        mem[i][l]--;
                        mem[k][j]--;
                        mem[k][l]++;
                        // cerr << i << " " << j << " " << k << " " << l << endl;
                    }
                }
            }
        }
    }

    for(int i = 0; i <= m; i++){
        for(int j = 0; j < m; j++){
            mem[i][j+1] += mem[i][j];
        }
    }
    for(int j = 0; j <= m; j++){
        for(int i = 0; i < m; i++){
            mem[i+1][j] += mem[i][j];
        }
    }

    for(int i = 0; i < n; i++){
        cout << mem[x[i]][y[i]] << '\n';
    }
    return 0;
}