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

//#include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using cint = cpp_int;
//#define input(a) scanf("%lld", &(a))
//#define output(a) printf("%lld\n", (a))

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = 1e9 + 7;
const ll INF = LONG_MAX;
// const ull MAX = ULONG_MAX;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define endl '\n'
#define space ' '
#define def inline auto
#define func inline constexpr ll
#define run __attribute__((constructor)) def _
#define all(v) begin(v), end(v)

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << endl;                                                          \
    }

#define dump(a, h, w)                                                          \
    rep(i, h) {                                                                \
        rep(j, w) cerr << a[i][j] << space;                                    \
        cerr << endl;                                                          \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define each(i, a) for (auto &&i : a)
#define rep(i, n) inc(i, 0, n - 1)

// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)

// Speed
run() { fasten, fout(10); }
#pragma GCC optimize("O3")
#pragma GCC optimization_level 3
#pragma GCC target("avx")

// Math
func gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
func lcm(ll a, ll b) { return a * b / gcd(a, b); }

def input() {
    ll A;
    cin >> A;
    return A;
}

ll res, N, M, X, Y, S[131][131];

def culc(ll x1, ll y1, ll x2, ll y2) {
    return S[x1 - 1][y1 - 1] + S[x2][y2] - S[x1 - 1][y2] - S[x2][y1 - 1] == 0;
}

signed main() {
    cin >> N >> M;
    rep(i, M) rep(j, M) cin >> S[i + 1][j + 1];
    rep(i, M) rep(j, M) S[i + 1][j + 1] += S[i][j + 1] + S[i + 1][j] - S[i][j];

    // dump(S, M + 1, M + 1);

    rep(i, N) {
        cin >> X >> Y;
        res = 0;
        rep(x1, M) rep(y1, M) rep(x2, M) rep(y2, M) {
            if (x1 + 1 <= X && X <= x2 + 1 && y1 + 1 <= Y && Y <= y2 + 1) {

                // debug(x1, y1, x2, y2, culc(x1, y1, x2, y2));

                res += culc(x1 + 1, y1 + 1, x2 + 1, y2 + 1);
            }
        }
        cout << res << endl;
    }
}