#include <iostream>
#include <fstream>
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string> 
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <random>

using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) { if (flg) { cout << hoge << endl; exit(0); } }
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) { o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o; }
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) { o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o; }
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) { o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o; }
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) { o << "{" << obj.first << ", " << obj.second << "}"; return o; }
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) { o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o; }
void print(void) { cout << endl; }
template <class Head> void print(Head&& head) { cout << head; print(); }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { cout << head << " "; print(forward<Tail>(tail)...); }
template <class T> void chmax(T& a, const T b) { a = max<T>(a, b); }
template <class T> void chmin(T& a, const T b) { a = min<T>(a, b); }
void YN(bool flg) { cout << ((flg) ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << ((flg) ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << ((flg) ? "yes" : "no") << endl; }

int main() {
	int N, M, Q; cin >> N >> M >> Q;
	V<V<ll>> a(2 * N, V<ll>(2 * M, 0)), b(2 * N, V<ll>(2 * M, 0));
	for(int i = 0; i < N; ++i){
		string S; cin >> S;
		for(int j = 0; j < M; ++j){
			a[2 * i + 1][2 * j + 1] = S[j] - '0';
		}
	}
	for (int i = 0; i < 2*N; ++i) {
		for (int j = 0; j < 2*M; ++j) {
			if (0 <= i - 1 && i + 1 < 2 * N&&a[i - 1][j] && a[i + 1][j]) b[i][j]++;
			if (0 <= j - 1 && j + 1 < 2 * M&&a[i][j - 1] && a[i][j + 1]) b[i][j]++;
		}
	}

	for (int i = 0; i < 2 * N; ++i) {
		for (int j = 1; j < 2 * M; ++j) {
			a[i][j] += a[i][j - 1];
		}
	}
	for (int i = 1; i < 2 * N; ++i) {
		for (int j = 0; j < 2 * M; ++j) {
			a[i][j] += a[i - 1][j];
		}
	}
	for (int i = 0; i < 2 * N; ++i) {
		for (int j = 1; j < 2 * M; ++j) {
			b[i][j] += b[i][j - 1];
		}
	}
	for (int i = 1; i < 2 * N; ++i) {
		for (int j = 0; j < 2 * M; ++j) {
			b[i][j] += b[i - 1][j];
		}
	}


	V<ll> ans(Q);
	for (int i = 0; i < Q; ++i){
		int y1, x1, y2, x2; cin >> y1 >> x1 >> y2 >> x2;
		y1--, x1--, y2--, x2--;
		y1 = 2 * y1 + 1;
		x1 = 2 * x1 + 1;
		y2 = 2 * y2 + 1;
		x2 = 2 * x2 + 1;
		y1--, x1--;
		ll v = a[y2][x2] - a[y2][x1] - a[y1][x2] + a[y1][x1];
		ll e = b[y2][x2] - b[y2][x1] - b[y1][x2] + b[y1][x1];
		ans[i] = v - e;
	}
	for (int i = 0; i < Q; ++i) cout << ans[i] << endl;

	return 0;
}



Measured memory_bytes: 254208