#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
template <class T>
void _db(const char* dbStr, T e) {
  cout << dbStr << " = " << e << endl;
}
template <class T, class... L>
void _db(const char* dbStr, T e, L... r) {
  while (*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ',';
  _db(dbStr + 1, r...);
}
template <class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
  o << "[";
  int i = 0;
  for (const pair<S, T>& pr : v)
    o << (!i++ ? "" : ", ") << "{" << pr.first << " : " << pr.second << "}";
  return o << "]";
}
template <template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
  o << "[";
  int i = 0;
  for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
  return o << "]";
}
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
  return o << "(" << pr.first << ", " << pr.second << ")";
}
ostream& operator<<(ostream& o, const string& s) {
  for (const char& c : s) o << c;
  return o;
}
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
int n, m, q;
vvi naive;
V<pair<ll, ll>> sizes;
ll solve(int x, int y) {
  if (x <= 2 * n && y <= 2 * m) return naive[x][y];
  int lo = 0, hi = int(sizes.size()) - 1;
  while (lo < hi) {
    int mid = (lo + hi) >> 1;
    if (x <= sizes[mid].first && y <= sizes[mid].second)
      hi = mid;
    else
      lo = mid + 1;
  }
  int N = sizes[lo].first / 2, M = sizes[lo].second / 2;
  ll ret = (x > N ? y * 1LL * N / 2 : 0) + (y > M ? x * 1LL * M / 2 : 0) -
           (x > N && y > M ? N * 1LL * M / 2 : 0);
  int to_x = x - (x > N) * N, to_y = y - (y > M) * M;
  ll add = solve(to_x, to_y);
  if (x > N && y > M)
    ret += add;
  else
    ret += to_x * 1LL * to_y - add;
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cout.precision(10);
  cin.tie(0);
  cin >> n >> m >> q;
  naive.assign(2 * n + 1, vi(2 * m + 1, 0));
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      char c;
      cin >> c;
      naive[i][j] = c - '0';
      naive[i + n][j + m] = naive[i][j];
      naive[i][j + m] = naive[i + n][j] = !naive[i][j];
    }
  }
  for (int i = 1; i <= 2 * n; ++i) {
    true;
  }
  for (int i = 1; i <= 2 * n; ++i)
    for (int j = 1; j <= 2 * m; ++j)
      naive[i][j] += naive[i][j - 1] + naive[i - 1][j] - naive[i - 1][j - 1];
  sizes.push_back(make_pair(n, m));
  while (min(sizes.back().first, sizes.back().second) < 1000000000)
    sizes.push_back(make_pair(sizes.back().first * 2, sizes.back().second * 2));
  for (int i = 1; i <= q; ++i) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    cout << solve(c, d) - solve(c, b - 1) - solve(a - 1, d) +
                solve(a - 1, b - 1)
         << '\n';
  }
  return 0;
}
