#ifndef __ACCUMULATOR_H__
#define __ACCUMULATOR_H__

#include <vector>
#include <algorithm>

template <class T>
class Accumulator2D {
	int height_m = 0;
	int width_m = 0;
	std::vector<std::vector<T>> sum_m;

public:
	Accumulator2D() = default;
	Accumulator2D(const std::vector<std::vector<T>>& arr);
	void initialize(const std::vector<std::vector<T>>& arr);
	T get(int i, int j) const;
	T get(int ai, int aj, int bi, int bj) const;
};

template <class T>
Accumulator2D<T>::Accumulator2D(const std::vector<std::vector<T>>& arr) {
	initialize(arr);
}

template<class T>
void Accumulator2D<T>::initialize(const std::vector<std::vector<T>>& arr) {
	height_m = arr.size();
	width_m = height_m == 0 ? 0 : arr.front().size();
	sum_m.resize(height_m + 1, std::vector<T>(width_m + 1, 0));

	for (int i = 0; i < height_m; ++i) {
		for (int j = 0; j < width_m; ++j) {
			sum_m[i + 1][j + 1] = sum_m[i][j + 1] + sum_m[i + 1][j] - sum_m[i][j] + arr[i][j];
		}
	}
}

template <class T>
T Accumulator2D<T>::get(int i, int j) const {
	int new_i = std::max(0, std::min(height_m, i));
	int new_j = std::max(0, std::min(width_m, j));
	return sum_m[new_i][new_j];
}

template <class T>
T Accumulator2D<T>::get(int ai, int aj, int bi, int bj) const {
	return get(ai, aj) - get(ai, bj) - get(bi, aj) + get(bi, bj);
}

#endif
#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "Interpolation.h"
#include "IntMod.h"
#include "KDTree.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

int H, W, Q;
string S[2000];
Accumulator2D<int> V;
Accumulator2D<int> EH;
Accumulator2D<int> EW;

int sub(int ax, int ay, int bx, int by) {
	return V.get(ax, ay, bx, by) - EH.get(ax, ay, bx - 1, by) - EW.get(ax, ay, bx, by - 1);
}

void pre() {
	vector<vector<int>> v(H, vector<int>(W));
	vector<vector<int>> eh(H, vector<int>(W));
	vector<vector<int>> ew(H, vector<int>(W));
	REP(i, 0, H) {
		REP(j, 0, W) {
			v[i][j] = S[i][j] == '1';
			if (i < H - 1) eh[i][j] = S[i][j] == '1' && S[i + 1][j] == '1';
			if (j < W - 1) ew[i][j] = S[i][j] == '1' && S[i][j + 1] == '1';
		}
	}

	V.initialize(v);
	EH.initialize(eh);
	EW.initialize(ew);
}

int main() {
	cin >> H >> W >> Q;
	REP(i, 0, H) cin >> S[i];
	pre();

	REP(k, 0, Q) {
		int ax, ay, bx, by;
		cin >> ax >> ay >> bx >> by;
		--ax; --ay;
		cout << sub(ax, ay, bx, by) << endl;
	}
	return 0;
}




Measured memory_bytes: 105136