// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

ll a[131][131];
ll sum[131][131];

struct point{
  int x, y;
  point(int x, int y): x(x), y(y){}
  point(): point(0, 0){}
  point & operator--(){
    x--;
    y--;
    return *this;
  }
  point operator--(int){
    point tmp = *this;
    --*this;
    return tmp;
  }
};

ll get(int x1, int y1, int x2, int y2){
  ll res = sum[x2][y2];
  if(x1>0)res -= sum[x1-1][y2];
  if(y1>0)res -= sum[x2][y1-1];
  if(x1 > 0 && y1 > 0)res += sum[x1-1][y1-1];
  return res;
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  rep(i, m){
    rep(j, m)cin >> a[i][j];
  }
  vector<point> vec(n);
  rep(i, n)cin >> vec[i].x >> vec[i].y, vec[i]--;
  for(int i = 0; i < m; i++){
    for(int j = 0; j < m; j++){
      sum[i][j] = a[i][j];
      if(i > 0)sum[i][j] += sum[i-1][j];
    }
  }
  for(int i = 0; i < m; i++){
    for(int j = 1; j < m; j++){
      sum[i][j] += sum[i][j-1];
    }
  }
  for(int i = 0; i < n; i++){
    int x = vec[i].x;
    int y = vec[i].y;
    int res = 0;
    for(int j = 0; j <= x; j++){
      for(int k = 0; k <= y; k++){
        for(int l = max(x, j); l < m; l++){
          for(int p = max(y, k); p < m; p++){
            ll s = get(j, k, l, p);
            if(s == 0)res++;
          }
        }
      }
    }
    cout << res << endl;
  }
	return 0;
}