/*
  Compete against Yourself.
  Author - Aryan Choudhary (@aryanc403)
*/

#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define fo(i,n)   for(i=0;i<(n);++i)
#define repA(i,j,n)   for(i=(j);i<=(n);++i)
#define repD(i,j,n)   for(i=(j);i>=(n);--i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define endl "\n"

typedef long long int lli;
typedef long double mytype;
typedef pair<lli,lli> ii;
typedef vector<ii> vii;
typedef vector<lli> vi;

clock_t time_p=clock();
void aryanc403()
{
#ifdef ARYANC403
    time_p=clock()-time_p;
    cerr<<"Time Taken : "<<(float)(time_p)/CLOCKS_PER_SEC<<"\n";
#endif
}

#ifdef ARYANC403
#include "/home/priank/codes/PastCodes/header.h"
#else
    #define dbg(args...)
#endif

const lli INF = 0xFFFFFFFFFFFFFFFL;

lli seed;
mt19937 rng(seed=chrono::steady_clock::now().time_since_epoch().count());
inline lli rnd(lli l=0,lli r=INF)
{return uniform_int_distribution<lli>(l,r)(rng);}

class CMP
{public:
bool operator()(ii a , ii b) //For min priority_queue .
{    return ! ( a.X < b.X || ( a.X==b.X && a.Y <= b.Y ));   }};

void add( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt==m.end())         m.insert({x,cnt});
    else                    jt->Y+=cnt;
}

void del( map<lli,lli> &m, lli x,lli cnt=1)
{
    auto jt=m.find(x);
    if(jt->Y<=cnt)            m.erase(jt);
    else                      jt->Y-=cnt;
}

bool cmp(const ii &a,const ii &b)
{
    return a.X<b.X||(a.X==b.X&&a.Y<b.Y);
}

const lli mod = 1000000007L;
// const lli maxN = 1000000007L;

    lli T,n,i,j,k,in,cnt,l,r,u,v,x,y;
    lli m;
    string s;
    vector<vi> dp[3];
    //priority_queue < ii , vector < ii > , CMP > pq;// min priority_queue .

void process(vector<vi> &a)
{
    lli i,j;
    repA(i,1,n)
    repA(j,1,m)
        a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
}

lli sum(const vector<vi> &a,lli xl,lli yl,lli xr,lli yr)
{
    if(xl>xr||yl>yr)
        return 0;
    xl--;yl--;
    return a[xr][yr]+a[xl][yl]-a[xr][yl]-a[xl][yr];
}
int main(void) {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    // freopen("txt.in", "r", stdin);
    // freopen("txt.out", "w", stdout);
// cout<<std::fixed<<std::setprecision(35);
// cin>>T;while(T--)
{
    lli q;
    cin>>n>>m>>q;
    dp[0].resize(n+1,vi(m+1,0));
    dp[1]=dp[2]=dp[0];

    repA(i,1,n){
        string s;
        cin>>s;
        repA(j,1,m)     dp[0][i][j]=s[j-1]-'0';
    }
    repA(i,1,n-1)   repA(j,1,m)
        dp[1][i][j]=(dp[0][i][j]&&dp[0][i+1][j]);

    repA(i,1,n)   repA(j,1,m-1)
        dp[2][i][j]=(dp[0][i][j]&&dp[0][i][j+1]);

    process(dp[0]);
    process(dp[1]);
    process(dp[2]);

    while(q--)
    {
        lli xl,yl,xr,yr;
        cin>>xl>>yl;
        cin>>xr>>yr;
        dbg(xl,yl,xr,yr);
        // continue;

        lli ans=0;
        ans+=sum(dp[0],xl,yl,xr,yr);
        ans-=sum(dp[1],xl,yl,xr-1,yr);
        ans-=sum(dp[2],xl,yl,xr,yr-1);
        cout<<ans<<endl;
    }

}   aryanc403();
    return 0;
}


Measured memory_bytes: 95872