/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author Majk
 */

#include <vector>
#include <iostream>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
using namespace std;

#define x first
#define y second
constexpr int MOD = 1000000007;

typedef std::pair<int,int> pii;
typedef long long ll;
typedef unsigned int ui;

template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
auto fraclt = [](const pii&a,const pii&b) { return (ll)a.x * b.y < (ll)b.x * a.y; };
struct cmpfrac { bool operator()(const pii&a,const pii&b)const { return (ll)a.x * b.y < (ll)b.x * a.y; }};
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
int logceil(ll x) {int b=0;while(x){x>>=1;++b;}return b;}

namespace std {
    template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}};
}
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector<vector<T>>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector<vector<T>>>(a,vector<vector<T>>(b,vector<T>(c,t))){}};

// #include "../l/mod.h"

class C {
public:
    void solve(istream& cin, ostream& cout) {
		int N, M, Q; cin >> N >> M >> Q;
		vector<string> S(N);
		cin >> S;

		vector2<int> V(N+1, M+1, 0), ER(N+1, M+1, 0), EC(N+1, M+1, 0);
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < M; ++j) {
				V[i+1][j+1] = V[i][j+1] + V[i+1][j] - V[i][j] + (S[i][j] == '1');
			}
		}
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < M; ++j) {
				ER[i+1][j+1] = ER[i][j+1] + ER[i+1][j] - ER[i][j];
				EC[i+1][j+1] = EC[i][j+1] + EC[i+1][j] - EC[i][j];
				if (S[i][j] == '1') {
					if (i > 0) EC[i+1][j+1] += S[i-1][j] == '1';
					if (j > 0) ER[i+1][j+1] += S[i][j-1] == '1';
				}
			}
		}

		for (int q = 0; q < Q; ++q) {
			int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
			--x1; --y1;
			int vert = V[x2][y2] - V[x2][y1] - V[x1][y2] + V[x1][y1];
			int edgeR = ER[x2][y2] - ER[x2][y1+1] - ER[x1][y2] + ER[x1][y1+1];
			int edgeC = EC[x2][y2] - EC[x2][y1] - EC[x1+1][y2] + EC[x1+1][y1];
			cout << vert - edgeR - edgeC << '\n';
		}

    }
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	C solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}



Measured memory_bytes: 53248