#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define drep2(i, m, n) for(int i=int(m)-1; i>=int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T> inline int sz(T &x) { return x.size(); }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << " "; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline int fLog2(const int x) { return 31-__builtin_clz(x); } // floor(log2(x))
inline int fLog2(const ll x) { return 63-__builtin_clzll(x); }
inline int cLog2(const int x) { return (x == 1) ? 0 : 32-__builtin_clz(x-1); } // ceil(log2(x))
inline int cLog2(const ll x) { return (x == 1) ? 0 : 64-__builtin_clzll(x-1); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
const int INF  = 1<<30;
const ll INFll = 1ll<<62;
const ld EPS   = 1e-10;
const ld PI    = acos(-1.0);
const int MOD  = int(1e9)+7;
// const int MOD  = 998244353;


int main() {
  int n, m, q; cin >> n >> m >> q;
  vector<string> s(n); cin >> s;


  VV cn(n+1, V(m+1));
  rep(i, n) rep(j, m) cn[i+1][j+1] = (s[i][j] - '0');
  rep(i, n) rep(j, m) cn[i+1][j+1] += cn[i+1][j];
  rep(i, n) rep(j, m) cn[i+1][j+1] += cn[i][j+1];

  VV ce0(n+1, V(m));
  rep(i, n) rep(j, m-1) ce0[i+1][j+1] = (s[i][j] == '1' && s[i][j+1] == '1');
  rep(i, n) rep(j, m-1) ce0[i+1][j+1] += ce0[i+1][j];
  rep(i, n) rep(j, m-1) ce0[i+1][j+1] += ce0[i][j+1];

  VV ce1(n, V(m+1));
  rep(i, n-1) rep(j, m) ce1[i+1][j+1] = (s[i][j] == '1' && s[i+1][j] == '1');
  rep(i, n-1) rep(j, m) ce1[i+1][j+1] += ce1[i+1][j];
  rep(i, n-1) rep(j, m) ce1[i+1][j+1] += ce1[i][j+1];

  rep(_, q) {
    int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;
    --x0, --y0;

    int ans = 0;
    ans += cn[x1][y1] - cn[x0][y1] - cn[x1][y0] + cn[x0][y0];
    ans -= ce0[x1][y1-1] - ce0[x0][y1-1] - ce0[x1][y0] + ce0[x0][y0];
    ans -= ce1[x1-1][y1] - ce1[x0][y1] - ce1[x1-1][y0] + ce1[x0][y0];

    cout << ans << '\n';
  }
  return 0;
}


Measured memory_bytes: 54640