// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 2e3 + 5;

int N, M, Q;
char A[MAXN][MAXN];

void input()
{
    read(N); read(M); read(Q);
    for (int i = 1; i <= N; ++i) {
        scanf("%s", A[i] + 1);
    }
}

void solve()
{
    static int sumV[MAXN][MAXN], sumEl[MAXN][MAXN], sumEu[MAXN][MAXN];

    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= M; ++j) {
            sumV[i][j] = sumV[i-1][j] + sumV[i][j-1] - sumV[i-1][j-1] + (A[i][j] == '1');
            sumEl[i][j] = sumEl[i-1][j] + sumEl[i][j-1] - sumEl[i-1][j-1] + (A[i][j] == '1' && A[i][j-1] == '1');
            sumEu[i][j] = sumEu[i-1][j] + sumEu[i][j-1] - sumEu[i-1][j-1] + (A[i][j] == '1' && A[i-1][j] == '1');
        }
    }

    while (Q--) {
        int x1, y1, x2, y2;
        read(x1); read(y1); read(x2); read(y2);
        int v = sumV[x2][y2] - sumV[x1-1][y2] - sumV[x2][y1-1] + sumV[x1-1][y1-1];
        int el = sumEl[x2][y2] - sumEl[x1-1][y2] - sumEl[x2][y1] + sumEl[x1-1][y1];
        int eu = sumEu[x2][y2] - sumEu[x1][y2] - sumEu[x2][y1-1] + sumEu[x1][y1-1];
        int e = el + eu;
        int c = v - e;
        printf("%d\n", c);
    }
}

int main()
{
#ifdef __DEBUG
    freopen("C.in", "r", stdin);
    freopen("C.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 戚姬髡发入舂市，万古共悲辛。
//     -- 李白《中山孺子妾歌》


Measured memory_bytes: 52864