#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

int dd[] = {1,0,-1,0,1};
int ar[2010][2010][4];
vvint vv;
vvint used;
int n,m;


bool inside(int a, int b, int h = n, int w = m){
	return 0<=a&&a<h&&0<=b&&b<w;
}

void func(int a, int b){
	used[a][b] = 1;
	rep(i,4){
		int aa = a + dd[i];
		int bb = b + dd[i+1];
		if(inside(aa,bb) && vv[aa][bb] && used[aa][bb] == 0){
			ar[aa][bb][i] = 1;
			func(aa,bb);
		}
	}
}

void mainmain(){
	int Q;
	cin>>n>>m>>Q;
	initvv(vv, n, m);
	initvv(used, n, m);
	pii root(-1,-1);
	rep(i,n){
		rep(j,m){
			char t;
			cin>>t;
			vv[i][j] = t-'0';
		}
	}
	vvint cnt;
	initvv(cnt, n, m);

	rep(i,n){
		rep(j,m){
			if(vv[i][j] && used[i][j] == 0){
				func(i,j);
				cnt[i][j]++;
				// cout<<i<<" "<<j<<endl;
			}
		}
	}
	rep(i,n){
		rep(j,m){
			if(i) cnt[i][j] += cnt[i-1][j];
			if(j) cnt[i][j] += cnt[i][j-1];
			if(i&&j) cnt[i][j] -= cnt[i-1][j-1];
		}
	}
	rep(i,Q){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		a--,b--,c--,d--;
		int ans = cnt[c][d];
		if(a) ans -= cnt[a-1][d];
		if(b) ans -= cnt[c][b-1];
		if(a&&b) ans += cnt[a-1][b-1];
		// cout<<"pre "<<ans<<endl;
		rep(i,a,c+1){
			ans += ar[i][b][3];
			// dump(ar[i][b][3]);
			ans += ar[i][d][1];
			// dump(ar[i][d][1]);
		}
		rep(i,b,d+1){
			ans += ar[a][i][0];
			ans += ar[c][i][2];
		}
		cout<<ans<<endl;
	}
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 112000