#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  int n, m;
  cin >> n >> m;
  vector<vector<int>> a(m, vector<int>(m));
  vector<vector<ll>> d_cum(m+1, vector<ll>(m,0));
  rep(i,m) rep(j,m) cin >> a[i][j], d_cum[i+1][j+1] = a[i][j];
  rep(i,m) rep(j,m) d_cum[i+1][j+1] += d_cum[i+1][j] + d_cum[i][j+1] - d_cum[i][j];

  while (n--) {
    int x, y;
    cin >> x >> y;
    int res = 0;
    for (int a = 0; a < x; a++) {
      for (int b = 0; b < y; b++) {
        for (int c = x; c <= m; c++) {
          for (int d = y; d <= m; d++) {
            ll sum = d_cum[c][d] - d_cum[a][d] - d_cum[c][b] + d_cum[a][b];
            if (!sum) res++;
          }
        }
      }
    }
    cout << res << endl;
  } 
  return 0;
}