#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

int main() {
	ll N, M, Q;
	cin >> N >> M >> Q;

	vvll s(N + 1, vll(M + 1, 0));

	repn(i, N)repn(j, M) {
		char c;
		cin >> c;
		s[i][j] = c - '0';
	}

	vvvll c(2, vvll(N + 1, vll(M + 1, 0)));

	repn(i, N)repn(j, M) {
		if (s[i][j] == 1 && s[i - 1][j] == 1) { c[0][i][j]++; }
		if (s[i][j] == 1 && s[i][j - 1] == 1) { c[1][i][j]++; }
		//cout << i<<j<<c[0][i][j] << c[1][i][j] << endl;
	}

	vvvll ruic(2, vvll(N + 1, vll(M + 1, 0)));
	vvll ch(N + 1, vll(M + 1, 0));
	repn(i, N)repn(j, M)rep(k, 2) {
		ruic[k][i][j] = ruic[k][i - 1][j] + ruic[k][i][j - 1] - ruic[k][i - 1][j - 1] + c[k][i][j];
		//cout << i << j << ruic[0][i][j] << ruic[1][i][j] << endl;
	}
	repn(i, N)repn(j, M) {
		ch[i][j] = ch[i - 1][j] + ch[i][j - 1] - ch[i - 1][j - 1] + s[i][j];
	}

	repn(q, Q) {
		ll x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;

		ll hen = ruic[0][x2][y2] - ruic[0][x2][y1 - 1] - ruic[0][x1][y2] + ruic[0][x1][y1 - 1];
		hen += ruic[1][x2][y2] - ruic[1][x2][y1] - ruic[1][x1 - 1][y2] + ruic[1][x1 - 1][y1];
		ll v = ch[x2][y2] - ch[x2][y1 - 1] - ch[x1 - 1][y2] + ch[x1-1][y1-1];
		//cout << v << " " << hen << endl;

		cout << v-hen << endl;
	}

}

Measured memory_bytes: 191332