#include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <numeric>
#include <vector>
#include <climits>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;

int main() {
    int n, m;
    cin >> n >> m;

    vector table(m, vector<i64>(m));
    for(auto & i : table) for(auto & j : i) cin >> j;

    vector sum(m + 1, vector<i64>(m + 1));
    rep(i, 1, m + 1) {
        rep(j, 1, m + 1) {
            sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + table[i - 1][j - 1];
        }
    }

    vector ans(m, vector<int>(m));
    rep(i, m) {
        rep(j, m) {
            rep(k, i, m) {
                rep(l, j, m) {
                    int now = sum[k + 1][l + 1] - sum[k + 1][j] - sum[i][l + 1] + sum[i][j];
                    if(now == 0) {
                        rep(nowi, i, k + 1) rep(nowj, j, l + 1) {
                            ans[nowi][nowj]++;
                        }
                    }
                }
            }
        }
    }
    vector<int> all_ans;
    while(n--) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        all_ans.push_back(ans[x][y]);
    }

    for(auto i : all_ans) cout << i << endl;
    
    return 0;
}