//start of jonathanirvings' template v3.0.3 (BETA)

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

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

int R,C,q;
string data[2005];
int ada[2005][2005];
int kiri[2005][2005];
int atas[2005][2005];
int a,b,c,d;

int queryada(int a,int b,int c,int d)
{
  if (a > c || b > d) return 0;
  return ada[c][d] - ada[a-1][d] - ada[c][b-1] + ada[a-1][b-1];
}

int querykiri(int a,int b,int c,int d)
{
  if (a > c || b > d) return 0;
  return kiri[c][d] - kiri[a-1][d] - kiri[c][b-1] + kiri[a-1][b-1];
}

int queryatas(int a,int b,int c,int d)
{
  if (a > c || b > d) return 0;
  return atas[c][d] - atas[a-1][d] - atas[c][b-1] + atas[a-1][b-1];
}

int main()
{
  scanf("%d %d %d",&R,&C,&q);
  FORN(j,0,C) data[0] += '0';
  REPN(i,R)
  {
    data[i] = "0" + GetString();
  }
  REPN(i,R) REPN(j,C)
  {
    ada[i][j] = ada[i-1][j] + ada[i][j-1] - ada[i-1][j-1];
    kiri[i][j] = kiri[i-1][j] + kiri[i][j-1] - kiri[i-1][j-1];
    atas[i][j] = atas[i-1][j] + atas[i][j-1] - atas[i-1][j-1];
    if (data[i][j] == '1')
    {
      ++ada[i][j];
      if (data[i][j-1] == '1') ++kiri[i][j]; 
      if (data[i-1][j] == '1') ++atas[i][j];
    }
  }
  // REPN(i,R)
  // {
  //   REPN(j,C) printf("%d",ada[i][j]);
  //   puts("");
  // }
  TC(q)
  {
    scanf("%d %d %d %d",&a,&b,&c,&d);
    int sq = queryada(a,b,c,d);
    int ki = querykiri(a,b+1,c,d);
    int at = queryatas(a+1,b,c,d);
    printf("%d\n",sq-ki-at);
  }
  return 0;
}










Measured memory_bytes: 56832