#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename A, size_t N, typename T>void Fill(A (&array)[N], const T&v)
{fill((T*)array,(T*)(array+N),v);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
const int N = 2005;
int n, m, q;
string s[N];

struct SegTree{
  typedef int T;
  T e = 0;
  T m(const T&a, const T&b){return a + b;}
//###################################################
  typedef int i;i n;vector<T> d;
  void init(i m){n=1<<(32-__builtin_clz(m-1));d.resize(2*n-1);FOR(j,0,2*n-1)d[j]=e;}
  void init(vector<T>&v){n=1<<(32-__builtin_clz(sz(v)-1));d.resize(2*n-1);FOR(j,0,sz(v))d[j+n-1]=v[j];FORR(k, n-2, 0)d[k]=m(d[k*2+1],d[k*2+2]);}
  void update(i k,T a){k+=n-1;d[k]=a;while(k>0){k=(k-1)/2;d[k]=m(d[k*2+1],d[k*2+2]);}}
  T q(i a,i b,i k,i l,i r){return (r<=a||b<=l)?e:(a<=l&&r<=b)?d[k]:m(q(a,b,k*2+1,l,(l+r)/2),q(a,b,k*2+2,(l+r)/2,r));}
  T query(i a,i b){return q(a,b,0,0,n);}
};
SegTree rig[N], lef[N], up[N], down[N];
bool z[N][N];
int rc[N][N];

void dfs(int x, int y, int px, int py){
  z[x][y] = true;
  int _x, _y;
  _x = x + 1;
  _y = y;
  if(_x < n && (_x != px || _y != py) && s[_x][_y] == '1'){
    down[x].update(y, 1);
    dfs(_x, _y, x, y);
  }
  _x = x - 1;
  _y = y;
  if(0 <= _x && (_x != px || _y != py) && s[_x][_y] == '1'){
    up[_x].update(y, 1);
    dfs(_x, _y, x, y);
  }
  _x = x;
  _y = y + 1;
  if(_y < m && (_x != px || _y != py) && s[_x][_y] == '1'){
    rig[y].update(x, 1);
    dfs(_x, _y, x, y);
  }
  _x = x;
  _y = y - 1;
  if(0 <= _y && (_x != px || _y != py) && s[_x][_y] == '1'){
    lef[_y].update(x, 1);
    dfs(_x, _y, x, y);
  }
}

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m >> q;
  FOR(i, 0, n)cin >> s[i];
  FOR(i, 0, n+1){
    up[i].init(m+1);
    down[i].init(m+1);
  }
  FOR(i, 0, m+1){
    rig[i].init(n+1);
    lef[i].init(n+1);
  }
  FOR(i, 0, n)FOR(j, 0, m){
    if(s[i][j] == '0' || z[i][j]) continue;
    rc[i][j]++;
    dfs(i, j, -1, -1);
  }
  FOR(i, 0, n){
    int s = 0;
    FOR(j, 0, m){
      s += rc[i][j];
      rc[i][j] = s;
    }
  }
  FOR(j, 0, m){
    int s = 0;
    FOR(i, 0, n){
      s += rc[i][j];
      rc[i][j] = s;
    }
  }
  FOR(i, 0, q){
    int xu, xd, yl, yr, ans;
    cin >> xu >> yl >> xd >> yr;
    xu--; yl--; xd--; yr--;
    ans = rc[xd][yr];
    if(xu > 0) ans -= rc[xu-1][yr];
    if(yl > 0) ans -= rc[xd][yl-1];
    if(xu > 0 && yl > 0) ans += rc[xu-1][yl-1];
    if(xu > 0) ans += down[xu-1].query(yl, yr+1);
    ans += up[xd].query(yl, yr+1);
    if(yl > 0) ans += rig[yl-1].query(xu, xd+1);
    ans += lef[yr].query(xu, xd+1);
    cout << ans << "\n";
  }
  return 0;
}

Measured memory_bytes: 156412