//author: dxm
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define INF 1e9
#define rep(i,n) for(int (i)=0;(i)<n;i++)
#define REP(i,n) for(int (i)=1;(i)<=n;i++)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
inline void Fail(){
	printf("0");
	exit(0);
}

const int maxn=2005;
int n,m,q;
int a[maxn][maxn];
char c[maxn];
int sum[maxn][maxn],sum2[maxn][maxn],sum3[maxn][maxn];

int main(){
	scanf("%d%d%d",&n,&m,&q);
	REP(i,n){
		scanf("%s",c);
		rep(j,m)a[i][j+1]=c[j]=='1';
		REP(j,m){
			sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+a[i][j];
			sum2[i][j]=sum2[i-1][j]+sum2[i][j-1]-sum2[i-1][j-1]+(a[i][j]&&a[i][j-1]);
			sum3[i][j]=sum3[i-1][j]+sum3[i][j-1]-sum3[i-1][j-1]+(a[i][j]&&a[i-1][j]); 
		}
	}
	while(q--){
		int r1,c1,r2,c2;
		scanf("%d%d%d%d",&r1,&c1,&r2,&c2);
		int ans=0;
		ans+=sum[r2][c2]-sum[r1-1][c2]-sum[r2][c1-1]+sum[r1-1][c1-1];
		ans-=sum2[r2][c2]-sum2[r1-1][c2]-sum2[r2][c1]+sum2[r1-1][c1];
		ans-=sum3[r2][c2]-sum3[r1][c2]-sum3[r2][c1-1]+sum3[r1][c1-1];
		printf("%d\n",ans);
	}
	return 0;
}

/*
Input:
-----------------
Output:
*/