#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int N, M, Q;
int B[2010][2010]; //blocks
int S[2010][2010]; //num of blocks;
int E[2010][2010]; //num of edge
int U[2010][2010], D[2010][2010], L[2010][2010], R[2010][2010];

void solve() {
	cin >> N >> M >> Q;
	rep(i, 0, N) {
		rep(j, 0, M) {
			char b; cin >> b;
			B[i][j] = (b == '1');
		}
	}
	rep(i, 0, N) {
		rep(j, 0, M) {
			S[i + 1][j + 1] += B[i][j] + S[i][j + 1] + S[i + 1][j] - S[i][j];
			int e = 0;
			rep(k, 0, 4) {
				int nx = i + dx[k], ny = j + dy[k];
				if(0 <= nx && nx < N && 0 <= ny && ny < M) {
					e += B[nx][ny] * B[i][j];
				}
			}
			E[i + 1][j + 1] += e + E[i][j + 1] + E[i + 1][j] - E[i][j];
			// debug(i, j, B[i][j], e);
		}
	}
	rep(i, 0, N) {
		rep(j, 0, M) {
			int u = 0, d = 0;
			if(i != 0) {
				u = (B[i][j] && B[i - 1][j]);
			}
			if(i != N - 1) {
				d = (B[i][j] && B[i + 1][j]);
			}
			U[i][j + 1] += U[i][j] + u;
			D[i][j + 1] += D[i][j] + d;
		}
	}
	rep(j, 0, M) {
		rep(i, 0, N) {
			int l = 0, r = 0;
			if(j != 0) {
				l = (B[i][j] && B[i][j - 1]);
			}
			if(j != M - 1) {
				r = (B[i][j] && B[i][j + 1]);
			}
			L[i + 1][j] += L[i][j] + l;
			R[i + 1][j] += R[i][j] + r;
		}
	}
	while(Q--) {
		int a, b, c, d; cin >> a >> b >> c >> d; a--; b--; c--; d--;
		int e = (E[c + 1][d + 1] - E[a][d + 1] - E[c + 1][b] + E[a][b]);
		e -= U[a][d + 1] - U[a][b];
		e -= D[c][d + 1] - D[c][b];
		e -= L[c + 1][b] - L[a][b];
		e -= R[c + 1][d] - R[a][d];
		cout << (S[c + 1][d + 1] - S[a][d + 1] - S[c + 1][b] + S[a][b]) - e / 2 << "\n";
	}
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 112256