#include<bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ios\
    ios::sync_with_stdio(false);\
    cin.tie(nullptr);
#define VEC(type, name, size)\
    V<type> name(size);\
    IN(name)
#define VVEC(type, name, h, w)\
    VV<type> name(h, V<type>(w));\
    IN(name)
#define INT(...)\
    int __VA_ARGS__;\
    IN(__VA_ARGS__)
#define LL(...)\
    ll __VA_ARGS__;\
    IN(__VA_ARGS__)
#define STR(...)\
    string __VA_ARGS__;\
    IN(__VA_ARGS__)
#define CHAR(...)\
    char __VA_ARGS__;\
    IN(__VA_ARGS__)
#define DOUBLE(...)\
    DOUBLE __VA_ARGS__;\
    IN(__VA_ARGS__)
#define LD(...)\
    LD __VA_ARGS__;\
    IN(__VA_ARGS__)
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &a) { for(auto &i : a) scan(i); }
template <class T, class L> void scan(pair<T, L> &p){ scan(p.first); scan(p.second); }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &... tail) { scan(head); IN(tail...); }
template <class T> inline void print(T x){ cout << x << '\n';}
#define ll long long
#define ld long double
#define FOR(i,l,r) for(ll i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(ll i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true; }return false; }
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true; }return false; }
inline void Yes(bool b = true) {cout << (b ? "Yes" : "No") << '\n';}
inline void YES(bool b = true) {cout << (b ? "YES" : "NO") << '\n';}
inline void err(bool b = true) {if(b) {cout << -1 << '\n'; exit(0);}}
template<class T> inline void fin(bool b = true, T e = 0) {if(b) {cout << e << '\n'; exit(0);}}
template<class T> T Roundup_div(T x, T y) {return (x+(y-1))/y;}
template <typename T> T pow(T a, long long n, T e = 1) {T ret = e; while (n) {if (n & 1) ret *= a; a *= a; n >>= 1; } return ret; }
const ll INF = 1e18;
#pragma endregion

int main(){
    ios;
    INT(n, m, q);
    VVEC(char, a, n, m);
    VV<> cum(n + 1, V<>(m + 1, 0)), wcum(n + 1, V<>(m, 0)), hcum(n, V<>(m + 1, 0));

    REP(i, n) REP(j, m){
        int d = a[i][j] - '0';
        cum[i + 1][j + 1] = cum[i + 1][j] + cum[i][j + 1] - cum[i][j] + d;
    }

    REP(i, n) REP(j, m - 1){
        int d = a[i][j] - '0', e = a[i][j + 1] - '0';
        wcum[i + 1][j + 1] = d and e;
    }
    REP(i, n) REP(j, m - 1){
        wcum[i + 1][j + 1] += wcum[i + 1][j] + wcum[i][j + 1] - wcum[i][j];
    }

    REP(i, n - 1) REP(j, m){
        int d = a[i][j] - '0', e = a[i + 1][j] - '0';
        hcum[i + 1][j + 1] = d and e;
    }
    REP(i, n - 1) REP(j, m){
        hcum[i + 1][j + 1] += hcum[i + 1][j] + hcum[i][j + 1] - hcum[i][j];
    }
    int x1, y1, x2, y2;
    while(cin >> x1 >> y1 >> x2 >> y2){
        x1--; y1--;
        ll node = cum[x2][y2] - cum[x1][y2] - cum[x2][y1] + cum[x1][y1];
        ll edge = hcum[x2 - 1][y2] - hcum[x1][y2] - hcum[x2 - 1][y1] + hcum[x1][y1] + wcum[x2][y2 - 1] - wcum[x1][y2 - 1] - wcum[x2][y1] + wcum[x1][y1];
        print(node - edge);
    }
}

Measured memory_bytes: 101112