#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

struct Accum2D{
  map<ll, ll> x, y;
  ll mode = 1;
  vvl dat;
  vvl v;
  Accum2D(vvl point, ll h=0, ll w=0){
    if(point.size()==0) mode=0;
    for(int i=0;i<point.size();i++){
      if(x.find(point[i][0])==x.end()) x.emplace(point[i][0], 0);
      if(y.find(point[i][1])==y.end()) y.emplace(point[i][1], 0);
    }
    ll k = 0;
    for(auto itr = x.begin();itr!=x.end();itr++) (*itr).second = k, k++;
    k = 0;
    for(auto itr = y.begin();itr!=y.end();itr++) (*itr).second = k, k++;
    if(mode==1) {
      dat.resize(x.size(), vll(y.size(), 0));
      v.resize(x.size(), vll(y.size(), 0));
    }else {
      dat.resize(h+1, vll(w+1, 0));
      v.resize(h+1, vll(w+1, 0));
    }
  }
  void insert(ll a, ll b, ll x){
    dat[a][b] = x;
  }
  void calc(){
    for(int j=0;j<v[0].size();j++){
      for(int i=0;i<v.size();i++){
        v[i][j] = (i==0?0:v[i-1][j]) + dat[i][j];
      }
    }
    for(int i=0;i<v.size();i++){
      for(int j=0;j<v[0].size();j++){
        v[i][j] = v[i][j] + (j==0?0:v[i][j-1]);
      }
    }
  }
  ll get(ll a, ll b, ll c, ll d){
    if(a>c) swap(a, c);
    if(b>d) swap(b, d);
    if(mode==1){
      a = x.at(a), b = y.at(b);
      c = x.at(c), d = y.at(d);
    }
    ll r = v[c][d];
    ll u = (a==0?0:v[a-1][d]);
    ll l = (b==0?0:v[c][b-1]);
    ll o = (a==0||b==0?0:v[a-1][b-1]);
    return r - u - l + o;
  }
};
int main() {
  ll n, m;std::cin >> n >> m;
  vvl d = VV(m, m, 0, ll);
  get(d);
  Accum2D ac(vvl{}, m, m);
  re(i, m) re(j, m) ac.insert(i, j, d[i][j]);
  ac.calc();
  re(t, n){
    ll x, y;std::cin >> x >> y;
    x--, y--;
    ll ans = 0;
    for(int i=0;i<=x;i++){
      for(int j=0;j<=y;j++){
        for(int l=x;l<m;l++){
          for(int r=y;r<m;r++){
            ll s = ac.get(i, j, l, r);
            if(s==0) ans++;
          }
        }
      }
    }
    std::cout << ans << '\n';
  }
}