#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>
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;

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 operator^(const ll& t)const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return 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;
    }
};

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


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

    vector<vector<ll>> S(N + 1, vector<ll>(M + 1,0));

    repn(i, N) {
        string ss;
        cin >> ss;
        repn(j, M) {
            S[i][j] = ss[j - 1]-'0';
        }
    }

    vector<vector<ll>> u(N + 1, vector<ll>(M + 1, 0));
    vector<vector<ll>> l(N + 1, vector<ll>(M + 1, 0));
    vector<vector<ll>> num(N + 1, vector<ll>(M + 1, 0));
    repn(i, N)repn(j, M) {
        u[i][j] = u[i - 1][j] + u[i][j - 1] - u[i - 1][j - 1];
        if (S[i][j] == 1 && S[i - 1][j] == 1) { u[i][j]++; }
        l[i][j] = l[i - 1][j] + l[i][j - 1] - l[i - 1][j - 1];
        if (S[i][j] == 1 && S[i][j - 1] == 1) { l[i][j]++; }
        num[i][j] = num[i - 1][j] + num[i][j - 1] - num[i - 1][j - 1];
        if (S[i][j] == 1) { num[i][j]++; }
        //cout << i << j << u[i][j] << l[i][j] << num[i][j] << endl;
    }

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

        ll a = num[x2][y2] - num[x1 - 1][y2] - num[x2][y1 - 1] + num[x1 - 1][y1 - 1];
        ll b = u[x2][y2] - u[x1][y2] - u[x2][y1 - 1] + u[x1][y1 - 1];
        ll c = l[x2][y2] - l[x1 - 1][y2] - l[x2][y1] + l[x1 - 1][y1];
        //cout << a << b << c << endl;
        cout << a - b - c << endl;
    }

    

	system("PAUSE");
}

Measured memory_bytes: 127872