#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, m;
    cin >> n >> m;
    vector<vector<ll>> a(m, vector<ll>(m));
    rep(i, m) rep(j, m) cin >> a[i][j];
    vector<ll> x(n), y(n);
    rep(i, n) {
        cin >> x[i] >> y[i];
        x[i]--; y[i]--;
    }
    vector<vector<ll>> dp(m + 1, vector<ll>(m + 1, 0));
    rep(i, m) rep(j, m) dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j] - dp[i][j] + a[i][j];
    vector<ll> ans(n, 0);
    rep(sx, m) {
        rep(sy, m) {
            reps(gx, sx, m) {
                reps(gy, sy, m) {
                    ll v = dp[gx + 1][gy + 1] - dp[gx + 1][sy] - dp[sx][gy + 1] + dp[sx][sy];
                    if (v == 0) {
                        rep(i, n) {
                            if ((sx <= x[i]) && (gx >= x[i]) && (sy <= y[i]) && (gy >= y[i])) {
                                ans[i]++;
                            }
                        }
                    }
                }
            }
        }
    }
    rep(i, n) cout << ans[i] << endl;
    return 0;
}