#include<bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

// sum_num[i][j]=num of blue cells in ([0,0]->[i-1,j-1])
li sum_num[2020][2020];
// sum_link[i][j]=num of egdes in [0,0]->[i,j]
li sum_link[2020][2020][2];
string s[2020];

int main() {
    li n, m, q;
    cin >> n >> m >> q;
    rin{sum_num[i][0] = 0;}
    rep(j, m) {sum_num[0][j] = 0;}
    rin{
        cin >> s[i];
        rep(j, m) {
            sum_num[i + 1][j + 1] = sum_num[i][j + 1] + sum_num[i + 1][j] - sum_num[i][j]
            + (s[i][j] - '0');
            sum_link[i][j][0] = 0;
            sum_link[i][j][1] = 0;
            if (j > 0) {
                if (s[i][j - 1] == '1' && s[i][j] == '1')sum_link[i][j][1]++;
                sum_link[i][j][0] += sum_link[i][j - 1][0];
                sum_link[i][j][1] += sum_link[i][j - 1][1];
            }
            if ( i > 0) {
                if (s[i - 1][j] == '1' && s[i][j] == '1')sum_link[i][j][0]++;
                sum_link[i][j][0] += sum_link[i - 1][j][0];
                sum_link[i][j][1] += sum_link[i - 1][j][1];
            }
            if (i > 0 && j > 0) {
                sum_link[i][j][0] -= sum_link[i - 1][j - 1][0];
                sum_link[i][j][1] -= sum_link[i - 1][j - 1][1];
            }
        }
    }

    rep(i, q) {
        PI pos[2];
        cin >> pos[0].F >> pos[0].S;
        cin >> pos[1].F >> pos[1].S;
        pos[0].F--;
        pos[0].S--;
        pos[1].F--;
        pos[1].S--;
        li sum = sum_num[pos[1].F + 1][pos[1].S + 1] -
                 sum_num[pos[1].F + 1][pos[0].S] -
                 sum_num[pos[0].F][pos[1].S + 1] +
                 sum_num[pos[0].F][pos[0].S];
        li link = sum_link[pos[1].F][pos[1].S][0] -
                  sum_link[pos[0].F][pos[1].S][0];
        if (pos[0].S > 0) {
            link += sum_link[pos[0].F][pos[0].S - 1][0] -
                    sum_link[pos[1].F][pos[0].S - 1][0];
        }
        li link2 = sum_link[pos[1].F][pos[1].S][1] -
                   sum_link[pos[1].F][pos[0].S][1];
        if (pos[0].F > 0) {
            link2 +=
                - sum_link[pos[0].F - 1][pos[1].S][1] +
                sum_link[pos[0].F - 1][pos[0].S][1];
        }
        // p3(sum, link, link2);
        cout << sum - link - link2 << endl;
    }
    /*
        rin{
            cout << s[i] << endl;
        }
        rep(i, n) {
            rep(j, m) {
                cout << sum_link[i][j][0] << " ";
            } cout << endl;
        }
        rep(i, n) {
            rep(j, m) {
                cout << sum_link[i][j][1] << " ";
            } cout << endl;
        }
    */
    return 0;
}

Measured memory_bytes: 101248