#include<iostream>
#include<algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int h,w,q,d[2010][2010],x[2010][2010],y[2010][2010];
bool m[2010][2010];
int main(){
	cin>>h>>w>>q;
	rep(i,h)rep(j,w){
		char z;cin>>z;m[i][j]=(z=='0')?0:1;
		d[i][j]=0,x[i][j]=0,y[i][j]=0;
	}
	for(int i=1;i<=h;i++)for(int j=1;j<=w;j++){
		d[i][j]=d[i-1][j]+d[i][j-1]-d[i-1][j-1]+m[i-1][j-1];
		x[i][j]=x[i-1][j]+x[i][j-1]-x[i-1][j-1];
		if(j<w)x[i][j]+=(m[i-1][j-1]&m[i-1][j]);
		y[i][j]=y[i-1][j]+y[i][j-1]-y[i-1][j-1];
		if(i<h)y[i][j]+=(m[i-1][j-1]&m[i][j-1]);
	}
	while(q--){
		int a,b,f,g;cin>>a>>b>>f>>g;a--,b--;
		int k=d[f][g]+d[a][b]-d[f][b]-d[a][g];
		k-=x[f][g-1]+x[a][b]-x[f][b]-x[a][g-1];
		k-=y[f-1][g]+y[a][b]-y[f-1][b]-y[a][g];
		cout<<k<<endl;
	}
	return 0;
}
