#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
using namespace std;
namespace _c {
const double pi = acos(-1.0);
namespace min {
const int i8 = -128;
const int i16 = -32768;
const int i = -2147483647 - 1;
const long long l = -9223372036854775807LL - 1;
}  // namespace min
namespace max {
const int i8 = 127;
const int i16 = 32767;
const int i = 2147483647;
const long long l = 9223372036854775807LL;
}  // namespace max
}  // namespace _c
namespace _f {
template <typename T>
inline const T gcd(T m, T n) {
  while (n != 0) {
    T t = m % n;
    m = n;
    n = t;
  }
  return m;
}
template <typename T>
inline const T max(const T &a, const T &b) {
  return a > b ? a : b;
}
template <typename T>
inline const T min(const T &a, const T &b) {
  return a < b ? a : b;
}
template <typename T>
inline const T abs(const T &a) {
  return a > 0 ? a : -a;
}
template <typename T>
inline T pow(T a, T b) {
  T res = 1;
  while (b > 0) {
    if (b & 1) {
      res = res * a;
    }
    a = a * a;
    b >>= 1;
  }
  return res;
}
template <typename T>
inline T pow(T a, T b, const T &m) {
  a %= m;
  T res = 1;
  while (b > 0) {
    if (b & 1) {
      res = res * a % m;
    }
    a = a * a % m;
    b >>= 1;
  }
  return res % m;
}
}  // namespace _f
namespace io {
template <typename T>
inline void read(T &t) {
  register T res = 0, neg = 1;
  char g = getchar();
  for (; !isdigit(g); g = getchar()) {
    if (g == '-') {
      neg = -1;
    }
  }
  for (; isdigit(g); g = getchar()) {
    res = res * 10 + g - '0';
  }
  t = res * neg;
}
inline int in() {
  register int T;
  read(T);
  return T;
}
inline long long in_ll() {
  register long long T;
  read(T);
  return T;
}
}  // namespace io
const int N = 1005;
int n, m, q;
char c[N][N];
long long dp[2 * N][2 * N];
bool Check(long long x, long long y) {
  if (x <= n && y <= m) {
    return true;
  }
  long long r = n, c = m;
  while (x > 2 * r || y > 2 * c) {
    r *= 2, c *= 2;
  }
  if ((x <= r) ^ (y <= c)) {
    return !Check((x - 1) % r + 1, (y - 1) % c + 1);
  }
  return Check((x - 1) % r + 1, (y - 1) % c + 1);
}
long long Solve(long long x, long long y) {
  long long tx = x % (2 * n), ty = y % (2 * m);
  long long ret = (x * y - tx * ty) / 2;
  if (Check(x - tx + 1, y - ty + 1)) {
    ret += dp[tx][ty];
  } else {
    ret += tx * ty - dp[tx][ty];
  }
  return ret;
}
int main() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 1; i <= n; i++) scanf("%s", c[i] + 1);
  for (int i = 1; i <= 2 * n; i++)
    for (int j = 1; j <= 2 * m; j++)
      dp[i][j] = ((c[(i - 1) % n + 1][(j - 1) % m + 1] == '1') ^
                  ((i <= n) ^ (j <= m))) +
                 dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1];
  for (int i = 1; i <= q; i++) {
    long long x1, y1, x2, y2;
    scanf("%lld %lld %lld %lld", &x1, &y1, &x2, &y2);
    printf("%lld ", Solve(x2, y2) - Solve(x1 - 1, y2) - Solve(x2, y1 - 1) +
                        Solve(x1 - 1, y1 - 1));
  }
  return 0;
}
