#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
long long T[(1 << 23) + 10][4];
int off = 1, lo, hi;
int idx;
long long VAL;
int n, m, w;
int VEL[5];
inline void refresh(int a, int b, int node) {
  b = min(VEL[idx] - 1, b);
  if (T[node][idx + 1]) {
    T[node][idx] += (long long)(b - a + 1) * T[node][idx + 1];
    if (a != b) {
      T[node * 2][idx + 1] += T[node][idx + 1];
      T[node * 2 + 1][idx + 1] += T[node][idx + 1];
    }
    T[node][idx + 1] = 0;
  }
}
void update(int a, int b, int node) {
  refresh(a, b, node);
  if (a > hi || b < lo) return;
  if (a >= lo && b <= hi) {
    T[node][idx + 1] += VAL;
    refresh(a, b, node);
    return;
  }
  update(a, (a + b) / 2, node * 2);
  update((a + b) / 2 + 1, b, node * 2 + 1);
  T[node][idx] = T[node * 2][idx] + T[node * 2 + 1][idx];
}
long long query(int a, int b, int node) {
  refresh(a, b, node);
  if (a > hi || b < lo) return 0;
  if (a >= lo && b <= hi) return T[node][idx];
  return query(a, (a + b) / 2, node * 2) +
         query((a + b) / 2 + 1, b, node * 2 + 1);
}
int main(void) {
  scanf("%d %d %d", &n, &m, &w);
  VEL[0] = n;
  VEL[2] = m;
  while (off < max(n, m)) off <<= 1;
  for (; w; w--) {
    int ty, x1, y1, x2, y2;
    scanf("%d %d %d %d %d", &ty, &x1, &y1, &x2, &y2);
    x1--;
    y1--;
    x2--;
    y2--;
    if (ty == 0) {
      int v;
      scanf("%d", &v);
      VAL = (long long)(y2 - y1 + 1) * v;
      lo = x1;
      hi = x2;
      idx = 0;
      update(0, off - 1, 1);
      VAL = (long long)(x2 - x1 + 1) * v;
      lo = y1;
      hi = y2;
      idx = 2;
      update(0, off - 1, 1);
    } else {
      lo = 0, hi = x1 - 1;
      idx = 0;
      long long ans = query(0, off - 1, 1);
      lo = x2 + 1, hi = n - 1;
      long long ans2 = query(0, off - 1, 1);
      idx = 2;
      lo = y1, hi = y2;
      long long ans3 = query(0, off - 1, 1);
      cout << ans3 - ans2 - ans << endl;
    }
  }
  return 0;
}
