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

typedef long long LL;
const int N = 3e6 + 5;

int tc, n, m, qn;
int tx, ax[N];
int ty, ay[N];
int t1, t2, t3;
struct Node {
  int x1, y1, x2, y2;
} q1[N], q2[N], q3[N];
vector<pair<int, int>> L[N], P[N];

inline int getx(int x) {
  return lower_bound(ax + 1, ax + tx + 1, x) - ax;
}
inline int gety(int y) {
  return lower_bound(ay + 1, ay + ty + 1, y) - ay;
}

struct SGT {
  int tag, mn, sum;
} t[N << 2];
#define ls (i << 1)
#define rs (i << 1 | 1)
#define mid ((l + r) / 2)
#define lp ls, l, mid
#define rp rs, mid, r
inline void upd(int i) {
  t[i].mn = min(t[ls].mn, t[rs].mn);
  t[i].sum = 0;
  if (t[i].mn == t[ls].mn) t[i].sum += t[ls].sum;
  if (t[i].mn == t[rs].mn) t[i].sum += t[rs].sum;
}
inline void pn(int i, int v) {
  t[i].mn += v;
  t[i].tag += v;
}
inline void down(int i) {
  if (t[i].tag) {
    pn(ls, t[i].tag);
    pn(rs, t[i].tag);
    t[i].tag = 0;
  }
}
void build(int i = 1, int l = 1, int r = ty) {
  if (l == r - 1) {
    t[i].mn = 0, t[i].sum = ay[r] - ay[l];
    return;
  }
  build(lp), build(rp), upd(i);
}
void mdf(int ql, int qr, int v, int i = 1, int l = 1, int r = ty) {
  if (ql >= r || qr <= l) return;
  if (ql <= l && qr >= r) {
    pn(i, v);
    return;
  }
  down(i);
  mdf(ql, qr, v, lp), mdf(ql, qr, v, rp), upd(i);
}
int qry(int ql, int qr, int i = 1, int l = 1, int r = ty) {
  if (ql >= r || qr <= l) return 0;
  if (ql <= l && qr >= r) {
    if (t[i].mn == 0) return t[i].sum;
    return 0;
  }
  down(i);
  return qry(ql, qr, lp) + qry(ql, qr, rp);
}
#undef mid

void Solve() {
  build();
  LL ans = 0;
  for (int i = 1; i < tx; i++) {
    for (auto [x, v] : L[i]) {
      mdf(x, x + 1, v);
    }
    for (auto [l, r] : P[i]) {
      mdf(l, r, 1);
    }
    LL sum = ay[ty] - ay[1];
    if (t[1].mn == 0) sum -= t[1].sum;
    ans += sum * (ax[i + 1] - ax[i]);

    vector<int> pos;
    for (int j = 1; j <= t3; j++) {
      auto [x1, y1, x2, y2] = q3[j];
      if (x1 <= i && i < x2) {
        pos.push_back(ay[y1] + (ax[i] - ax[x1]));
      }
    }
    sort(pos.begin(), pos.end());
    pos.erase(unique(pos.begin(), pos.end()), pos.end());
    for (auto l : pos) {
      sum = qry(gety(l), gety(l + ax[i + 1] - ax[i]));
      ans += sum;
    }
    for (auto [l, r] : P[i]) {
      mdf(l, r, -1);
    }
  }
  cout << ans << "\n";
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> tc;
  cin >> n >> m >> qn;
  for (int i = 1; i <= qn; i++) {
    int op, x1, y1, x2, y2;
    cin >> op >> x1 >> y1 >> x2 >> y2;
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    x2++, y2++;
    if (op == 1) {
      q1[++t1] = {x1, y1, x2, y2};
    }
    if (op == 2) {
      q2[++t2] = {x1, y1, x2, y2};
    }
    if (op == 3) {
      q3[++t3] = {x1, y1, x2, y2};
    }
    ax[++tx] = x1;
    ax[++tx] = x2;
    ay[++ty] = y1;
    ay[++ty] = y2;
  }
  sort(ax + 1, ax + tx + 1);
  tx = unique(ax + 1, ax + tx + 1) - ax - 1;
  for (int i = 1; i <= t1; i++) {
    q1[i].x1 = getx(q1[i].x1);
    q1[i].x2 = getx(q1[i].x2);
  }
  for (int i = 1; i <= t2; i++) {
    q2[i].x1 = getx(q2[i].x1);
    q2[i].x2 = getx(q2[i].x2);
  }
  for (int i = 1; i <= t3; i++) {
    q3[i].x1 = getx(q3[i].x1);
    q3[i].x2 = getx(q3[i].x2);
  }
  for (int i = 1; i <= t3; i++) {
    auto &[x1, y1, x2, y2] = q3[i];
    for (int j = 1; j < tx; j++) {
      if (x1 <= j && j < x2) {
        ay[++ty] = y1 + (ax[j] - ax[x1]);
        ay[++ty] = y1 + (ax[j + 1] - ax[x1]);
      }
    }
  }
  sort(ay + 1, ay + ty + 1);
  ty = unique(ay + 1, ay + ty + 1) - ay - 1;
  for (int i = 1; i <= t1; i++) {
    q1[i].y1 = gety(q1[i].y1);
    q1[i].y2 = gety(q1[i].y2);
  }
  for (int i = 1; i <= t2; i++) {
    q2[i].y1 = gety(q2[i].y1);
    q2[i].y2 = gety(q2[i].y2);
  }
  for (int i = 1; i <= t3; i++) {
    q3[i].y1 = gety(q3[i].y1);
    q3[i].y2 = gety(q3[i].y2);
  }
  for (int i = 1; i <= t1; i++) {
    auto &[x1, y1, x2, y2] = q1[i];
    L[x1].push_back({y1, 1});
    L[x2].push_back({y1, -1});
  }
  for (int i = 1; i <= t2; i++) {
    auto &[x1, y1, x2, y2] = q2[i];
    P[x1].push_back({y1, y2});
  }
  Solve();
  return 0;
}