#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 typedef pair<int,int> PII;

 typedef pair<ll,ll> Pll;

 typedef vector<int> VI;

 typedef vector<PII> VII;

 //typedef pair<ll,ll>P;

 #define N  210

 #define M  200010

 #define fi first

 #define se second

 #define MP make_pair

 #define pb push_back

 #define pi acos(-1)

 #define mem(a,b) memset(a,b,sizeof(a))

 #define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)

 #define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)

 #define lowbit(x) x&(-x)

 #define Rand (rand()*(1<<16)+rand())

 #define id(x) ((x)<=B?(x):m-n/(x)+1)

 #define ls p<<1

 #define rs p<<1|1

 const int MOD=1e9+,inv2=(MOD+)/;

       double eps=1e-;

       int INF=1e9;

       int inf=0x7fffffff;

       int dx[]={-,,,};

       int dy[]={,,-,};

 struct Q

 {

     int x1,y1,x2,y2,id;

 }t[M];

 int cnt[N*N],c[N*N];

 int ans[M],pos[],a[N][N],sum,L1,L2,R1,R2;

 int read()

 {

    int v=,f=;

    char c=getchar();

    while(c<||<c) {if(c=='-') f=-; c=getchar();}

    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();

    return v*f;

 }

 bool cmp(Q a,Q b)

 {

     return pos[a.x1]<pos[b.x1]

          ||pos[a.x1]==pos[b.x1]&&pos[a.y1]<pos[b.y1]

          ||pos[a.x1]==pos[b.x1]&&pos[a.y1]==pos[b.y1]&&pos[a.x2]<pos[b.x2]

          ||pos[a.x1]==pos[b.x1]&&pos[a.y1]==pos[b.y1]&&pos[a.x2]==pos[b.x2]&&pos[a.y2]<pos[b.y2];

 }

 void add(int op,int x,int y,int z)

 {

     if(op==)

     {

         if(!x) return;

         rep(j,y,z)

          if(j)

          {

             sum+=(cnt[a[x][j]]<<)+;

             cnt[a[x][j]]++;

          }

     }

      else

      {

          if(!z) return;

          rep(i,x,y)

           if(i)

           {

               sum+=(cnt[a[i][z]]<<)+;

               cnt[a[i][z]]++;

           }

      }

 }

 void del(int op,int x,int y,int z)

 {

     if(op==)

     {

         if(!x) return;

         rep(j,y,z)

          if(j)

          {

              sum=sum-(cnt[a[x][j]]<<)+;

              cnt[a[x][j]]--;

          }

     }

      else

      {

          if(!z) return;

          rep(i,x,y)

           if(i)

           {

               sum=sum-(cnt[a[i][z]]<<)+;

               cnt[a[i][z]]--;

           }

      }

 }

 int main()

 {

     int n=read(),m=read();

     int tot=;

     rep(i,,n)

      rep(j,,m)

      {

          a[i][j]=read();

          c[++tot]=a[i][j];

      }

     sort(c+,c+tot+);

     int k=unique(c+,c+tot+)-c-;

     rep(i,,n)

      rep(j,,m) a[i][j]=lower_bound(c+,c+k+,a[i][j])-c;

     int q=read();

     int S=pow(n*m,0.5)/pow(q,0.25)+;

     rep(i,,) pos[i]=(i-)/S;

     rep(i,,q)

     {

         int x1=read(),y1=read(),x2=read(),y2=read();

         t[i].x1=min(x1,x2);

         t[i].x2=max(x1,x2);

         t[i].y1=min(y1,y2);

         t[i].y2=max(y1,y2);

         t[i].id=i;

     }

     sort(t+,t+q+,cmp);

     L1=,L2=,R1=,R2=;

     sum=;

     rep(i,,q)

     {

         while(L1>t[i].x1)

         {

             L1--;

             add(,L1,R1,R2);

         }

         while(L2<t[i].x2)

         {

             L2++;

             add(,L2,R1,R2);

         }

         while(R1>t[i].y1)

         {

             R1--;

             add(,L1,L2,R1);

         }

         while(R2<t[i].y2)

         {

             R2++;

             add(,L1,L2,R2);

         }

         while(L1<t[i].x1)

         {

             del(,L1,R1,R2);

             L1++;

         }

         while(L2>t[i].x2)

         {

             del(,L2,R1,R2);

             L2--;

         }

         while(R1<t[i].y1)

         {

             del(,L1,L2,R1);

             R1++;

         }

         while(R2>t[i].y2)

         {

             del(,L1,L2,R2);

             R2--;

         }

         ans[t[i].id]=sum;

     }

     rep(i,,q) printf("%d\n",ans[i]);

     return ;

 }