#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 3010;
int a[N][N], tr[N][N][4];

int lowbit(int x) {
	return x & (-x);
}

void add(int x, int y, int c) {
	for (int i = x; i < N; i += lowbit(i)) {
		for (int j = y; j < N; j += lowbit(j)) {
			tr[i][j][0] += c;
			tr[i][j][1] += c * y;
			tr[i][j][2] += c * x;
			tr[i][j][3] += c * x * y;
		}
	}
}

int query(int x, int y) {
	int ans = 0;
	for (int i = x; i; i -= lowbit(i)) {
		for (int j = y; j; j -= lowbit((j))) {
			ans += tr[i][j][0] * (x + 1) * (y + 1) - (x + 1) * tr[i][j][1] - (y + 1) * tr[i][j][2] + tr[i][j][3];
		}
	}
	return ans;
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			int a = i, b = j, c = i, d = j;
			int o;
			cin >> o;
			add(a, b, o);
			add(a, d + 1, -o);
			add(c + 1, b, -o);
			add(c + 1, d + 1, o);
		}
	}
	while(k--){
		int op, a, b, c, d;
		cin >> op >> a >> b >> c >> d;
		if (op == 1) {
			int o;
			cin >> o;
			add(a, b, o), add(a, d + 1, -o), add(c + 1, b, -o), add(c + 1, d + 1, o);
		} else {
			cout << query(c,
				d) - query(a - 1, d) - query(c, b - 1) + query(a - 1, b - 1) << '\n';
		}
	}
	return 0;
}