#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
struct SegTree_Sum {
  int n;
  vector<long long> Tree, Lazy;
  SegTree_Sum() {}
  SegTree_Sum(int _n) {
    n = _n;
    Tree.resize(n * 4);
    Lazy.resize(n * 4);
  }
  void Propagate(int node, int st, int en) {
    if (Lazy[node] == 0) return;
    Tree[node] += Lazy[node] * (en - st + 1);
    if (st != en) {
      Lazy[node * 2 + 1] += Lazy[node];
      Lazy[node * 2 + 2] += Lazy[node];
    }
    Lazy[node] = 0;
  }
  void Update(int node, int st, int en, int L, int R, long long val) {
    Propagate(node, st, en);
    if (en < st || R < st || en < L) return;
    if (L <= st && en <= R) {
      Lazy[node] += val;
      Propagate(node, st, en);
      return;
    }
    Update(node * 2 + 1, st, (st + en) / 2 + 0, L, R, val);
    Update(node * 2 + 2, (st + en) / 2 + 1, en, L, R, val);
    Tree[node] = Tree[node * 2 + 1] + Tree[node * 2 + 2];
  }
  long long Sum(int node, int st, int en, int L, int R) {
    Propagate(node, st, en);
    if (en < st || R < st || en < L) return 0LL;
    if (L <= st && en <= R) return Tree[node];
    long long p1 = Sum(node * 2 + 1, st, (st + en) / 2 + 0, L, R);
    long long p2 = Sum(node * 2 + 2, (st + en) / 2 + 1, en, L, R);
    return (p1 + p2);
  }
  void RangeUpdate(int L, int R, long long val) {
    Update(0, 0, n - 1, L, R, val);
  }
  long long RangeSum(int L, int R) { return Sum(0, 0, n - 1, L, R); }
};
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int n, m, w;
  cin >> n >> m >> w;
  long long TotalCandies = 0;
  SegTree_Sum TreeRow = SegTree_Sum(n);
  SegTree_Sum TreeCol = SegTree_Sum(m);
  while (w--) {
    int t, x1, y1, x2, y2;
    cin >> t >> x1 >> y1 >> x2 >> y2;
    if (t == 0) {
      int v;
      cin >> v;
      TotalCandies += 1LL * (x2 - x1 + 1) * (y2 - y1 + 1) * v;
      TreeRow.RangeUpdate(x1, x2, 1LL * v * (y2 - y1 + 1));
      TreeCol.RangeUpdate(y1, y2, 1LL * v * (x2 - x1 + 1));
    } else if (t == 1) {
      long long res = 0;
      res += TreeRow.RangeSum(x1, x2);
      res += TreeCol.RangeSum(y1, y2);
      res -= TotalCandies;
      cout << res << '\n';
    }
  }
  return 0;
}
