#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
ll t,n,m,q,mod=1,u,v,x,y;
ll a[1005][1005],f[1005][1005];
int main(){
	cin>>t;
	for(int i=1;i<=64;i++) mod<<=1;
	while(t--){
		cin>>n>>m>>q;
		for(int i=1;i<=n;i++)Q
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
			if(j==1) f[i][j]=(f[i-1][m]+a[i][j])%mod;
			else f[i][j]=(f[i][j-1]+a[i][j])%mod;
		}
		while(q--){
			cin>>u>>v>>x>>y;
			cout<<(f[x][y]-f[u][y]-f[x][v]+f[u][v])%mod<<endl;
		}
	}
	return 0;
}