#include <iostream>
#include "map"
using namespace std;

int main() {
    int n, m, k;
    cin >> n >> m >> k;

    int a[n+2][m + 2] = {0};     // 原始矩阵（从1开始）
    int ai[n+2][m + 2] = {0};    // 前缀和矩阵

    // 读取原始矩阵
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> a[i][j];
            ai[i][j] = a[i][j] + ai[i - 1][j] + ai[i][j - 1] - ai[i - 1][j - 1];
        }
    }

    // 处理每个查询
    for (int i = 0; i < k; ++i) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        int result = ai[x2][y2] - ai[x1 - 1][y2] - ai[x2][y1 - 1] + ai[x1 - 1][y1 - 1];
        cout << result << endl;
    }

    return 0;
}

/**************************************************************
	Problem: 2061
	User: yangyucheng
	Language: C++
	Result: Time Limit Exceed
****************************************************************/