#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, m;
  cin >> n >> m;

  vector<vector<int> > a(m+1, vector<int>(m+1));
  REP (i, m) REP (j, m) cin >> a[i+1][j+1];

  vector<vector<long long> > csum(m+1, vector<long long>(m+1));
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= m; j++)
      csum[i][j] = csum[i][j-1] + a[j][i];
  
  REP (t, n) {
    int x, y;
    cin >> y >> x;

    int ret = 0;
    for (int y2 = 1; y2 <= m; y2++) {
      for (int y1 = 1; y1 <= y2; y1++) {
        if (y < y1 || y2 < y) continue;
        unordered_map<long long, int> hist;
        hist[0]++;
        long long cur = 0;
        for (int xt = 1; xt <= m; xt++) {
          cur += csum[xt][y2] - csum[xt][y1-1];
          if (xt < x) hist[cur]++;
          else ret += hist[cur];
        }
      }
    }
    cout << ret << endl;
  }
  
  return 0;
}