#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
using mint=modint1000000007;
//using mint=modint998244353;
const ll mod=1000000007;
//const ll mod=998244353;
//using mint=modint;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}

vector<ll>fast_mod_convolution(vector<ll>&a,vector<ll>&b,ll mod){
  const ll m1=167772161,m2=469762049,m3=1224736769;
  const ll m1_inv_m2=inv_mod(m1,m2);
  const ll m12_inv_m3=inv_mod(m1*m2,m3);
  const ll m12_mod=m1*m2%mod;
  auto x=convolution<m1>(a,b);
  auto y=convolution<m2>(a,b);
  auto z=convolution<m3>(a,b);
  vector<ll>ret(sz(a)+1);
  REP(i,sz(a)+1){
    ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;
    ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;
	ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;
  }
  return ret;
}

int main(){
  ll N,M;cin>>N>>M;
  vector<vector<ll>>A(M,vector<ll>(M));
  cin>>A;
  vector<vector<ll>>B(M,vector<ll>(M+1)),D(M+1,vector<ll>(M+1));
  REP(i,M)REP(j,M)B[i][j+1]=A[i][j]+B[i][j];
  REP(j,M)REP(i,j+1){
    vector<ll>C(M+1);
    REP(k,M)C[k+1]=C[k]+B[k][j+1]-B[k][i];
    auto X=C;sort(ALL(X));REP(k,M+1)C[k]=LB(X,C[k]);
    vector<vector<ll>>E(M+1);
    REP(k,M+1)E[C[k]].emplace_back(k);
    REP(k,M+1){
      ll L=sz(E[k]);
      REP(l,L-1){
        D[E[k][l]][i]+=(l+1)*(L-1-l);
        D[E[k][l+1]][i]-=(l+1)*(L-1-l);
        D[E[k][l]][j+1]-=(l+1)*(L-1-l);
        D[E[k][l+1]][j+1]+=(l+1)*(L-1-l);
      }
    }
  }
  REP(i,M+1)REP(j,M+1){
    if(i)D[i][j]+=D[i-1][j];
    if(j)D[i][j]+=D[i][j-1];
    if(i&&j)D[i][j]-=D[i-1][j-1];
  }
  while(N--){
    ll x,y;cin>>x>>y;x--;y--;
    cout<<D[x][y]<<endl;
  }
  return 0;
}