#include <map>

#include <set>

#include <cmath>

#include <ctime>

#include <queue>

#include <stack>

#include <cstdio>

#include <string>

#include <vector>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define ll long long

inline int gi()

{

    bool b=; int r=; char c=getchar();

    while(c<'' || c>'') { if(c=='-') b=!b; c=getchar(); }

    while(c>='' && c<='') { r=r*+c-''; c=getchar(); }

    if(b) return -r; return r;

}

const int inf = 1e9+, N = ;

int f[][N][N],I,J,K;

int main()

{

    int i,j,k;

    I=gi(), K=gi();

    for (i=; i<=I; i++)

        for (k=; k<=K; k++)

            f[][i][k]=gi();

    K=gi(), J=gi();

    for (k=; k<=K; k++)

        for (j=; j<=J; j++)

            f[][k][j]=gi();

    for (i=; i<=I; i++)

        for (j=; j<=J; j++)

            for (k=; k<=K; k++)

                f[][i][j]+=f[][i][k]*f[][k][j];

    for (i=; i<=I; i++)

        {

            for (j=; j<=J; j++)

                printf ("%d ",f[][i][j]);

            printf ("\n");

        }

    return ;

}

#include <map>

#include <set>

#include <cmath>

#include <ctime>

#include <queue>

#include <stack>

#include <cstdio>

#include <string>

#include <vector>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define ll long long

inline ll gi()

{

  bool b=; ll r=; char c=getchar();

  while(c<'' || c>'') { if(c=='-') b=!b; c=getchar(); }

  while(c>='' && c<='') { r=r*+c-''; c=getchar(); }

  if(b) return -r; return r;

}

const int inf = 1e9+, N = ;

int n,m;

ll f[][N][N],sum[N][N];

int main()

{

  n=gi(), m=gi();

  int i,j,x,y,q,w,a,b,c,d;

  ll ans;

  for (i=; i<=n; i++)

    for (j=; j<=n; j++)

      f[][i][j]=gi(), f[][i][j]+=f[][i-][j];

  for (i=; i<=n; i++)

    for (j=; j<=n; j++)

      f[][i][j]=gi(), f[][i][j]+=f[][i][j-];

  for (i=; i<m; i++)

    {

      x=gi(), y=gi(), q=gi(), w=gi(); ans=;

      a=max(x,q), b=max(y,w), c=min(x,q), d=min(y,w);

      for (j=; j<=n; j++)

    ans+=(f[][a][j]-f[][c-][j]) * (f[][j][b]-f[][j][d-]);

      printf ("%lld\n",ans);

    }

  return ;

}