#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll N, M; cin >> N >> M;
  ll A[M][M]; rep(i,M) rep(j,M) cin >> A[i][j];
  ll sa[M+1][M+1] = {}; rep(i,M) rep(j,M) sa[i+1][j+1] = sa[i][j+1] +sa[i+1][j] - sa[i][j] + A[i][j];
  // rep(i,M+1) debug(sa[i],sa[i]+M+1);

  ll x[N], y[N]; rep(i,N) { cin >> x[i] >> y[i]; x[i]--; y[i]--; }

  rep(i,N) {
    ll result = 0;
    rep(lx,x[i]+1) rep(ly,y[i]+1) repr(rx,x[i],M) repr(ry,y[i],M) {
      ll sum = sa[lx][ly] - sa[rx+1][ly] - sa[lx][ry+1] + sa[rx+1][ry+1];
      result += sum==0;
    }
    cout << result << endl;
  }

  // cout << result << endl;
  return 0;
}