#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl

using namespace std;

template<typename S,typename T>auto&operator<<(auto&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(auto&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(auto&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(auto&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(auto&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}};
template<typename S,typename T,typename U>
auto& operator<<(auto& o,TRI<S,T,U>& t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 2015;

int sm[MAX_N][MAX_N];
int p[MAX_N][MAX_N], q[MAX_N][MAX_N];

int x(int a, int b, int c, int d)
{
    // show(sm[c+1][d+1]);
    return sm[c+1][d+1]-sm[c+1][b]-sm[a][d+1]+sm[a][b];
}

int y(int a, int b, int c, int d)
{
    return p[c+1][d]-p[c+1][b]-p[a][d]+p[a][b];
}

int z(int a, int b, int c, int d)
{
    return q[c][d+1]-q[c][b]-q[a][d+1]+q[a][b];
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m, Q;
    cin >> n >> m >> Q;
    vs s(n);
    rep(i,n){
        cin >> s[i];
        rep(j,m){
            if(s[i][j] == '1') sm[i+1][j+1] = 1;
        }
    }
    rep(i,n){
        rep(j,m){
            if(i < n-1 && s[i][j] == '1' && s[i+1][j] == '1') q[i+1][j+1] = 1;
            if(j < m-1 && s[i][j] == '1' && s[i][j+1] == '1') p[i+1][j+1] = 1;
        }
    }
    rep(i,n+1){
        rep(j,m){
            sm[i][j+1] += sm[i][j];
        }
    }
    rep(j,m+1){
        rep(i,n){
            sm[i+1][j] += sm[i][j];
        }
    }
    // rep(i,n+1){
    //     rep(j,m+1){
    //         cout << sm[i][j] << " ";
    //     }
    //     cout << "\n";
    // }
    rep(i,n+1){
        rep(j,m+1){
            p[i][j+1] += p[i][j];
            q[i][j+1] += q[i][j];
        }
    }
    rep(j,m+1){
        rep(i,n+1){
            p[i+1][j] += p[i][j];
            q[i+1][j] += q[i][j];
        }
    }
    rep(i,Q){
        int a,b,c,d;
        cin >> a >> b >> c >> d;
        --a, --b, --c, --d;
        // ashow(a, b, c, d);
        // show(x(a,b,c,d)), show(y(a,b,c,d)), show(z(a,b,c,d));
        cout << x(a,b,c,d)-y(a,b,c,d)-z(a,b,c,d) << "\n";
    }
    return 0;
}


Measured memory_bytes: 53504