#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll mod=1000000007;
ll inf=10099990;
int main(){
    ll n,m;
    cin >> n >> m;
    vector<vector<ll>>a(m,vector<ll>(m));
    for (ll i = 0; i < m; i++)
    {
        for (ll j = 0; j < m; j++)
        {
            cin >> a[i][j];
        }
    }
    vector<vector<ll>>b(m,vector<ll>(m));
    for (ll i = 0; i < m; i++)
    {
        b[0][i]=a[0][i];
        b[i][0]=a[i][0];
        if (i>=1)
        {
            b[0][i]+=b[0][i-1];
            b[i][0]+=b[i-1][0];
        }
        
    }
    for (ll i = 1; i < m; i++)
    {
        for (ll j = 1; j < m; j++)
        {
            b[i][j]=b[i-1][j]+b[i][j-1]-b[i-1][j-1]+a[i][j];
        }
    }
    for (ll i = 0; i < n; i++)
    {
        ll x,y;
        cin >> x >> y;
        x--,y--;
        ll ans=0;
        for (ll j = 0; j <= x; j++)
        {
            for (ll k = 0; k <= y; k++)
            {
                ll z=0;
                if (j>0&&k>0)
                {
                    z+=b[j-1][k-1];
                }
                for (ll l = x; l < m; l++)
                {
                    for (ll o = y; o < m; o++)
                    {
                        ll now=z;
                        if (j>0)
                        {
                            now-=b[j-1][o];
                        }
                        if (k>0)
                        {
                            now-=b[l][k-1];
                        }
                        now+=b[l][o];
                        if (now==0)
                        {
                            ans++;
                        }
                    }
                }
            }
        }
        cout << ans << endl;
    }
}