#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
	
const int MAXN = 1e5 + 10;

int T, n, m, a, tot, tmp[MAXN << 1], t3[6];
bool calc[6];

struct Node {
	int t, x1, y1, x2, y2;
} q[MAXN];

struct Line {
	int l, r, h, w;
	
	bool operator<(const Line &rhs) const {
		return h < rhs.h;
	}
} b[MAXN << 1];

map<pii, bool> vis;

namespace SGT {
	#define lson pos << 1
	#define rson pos << 1 | 1
	
	ll w[MAXN << 3];
	int len[MAXN << 3], lazy[MAXN << 3];
	
	inline void pushup(int pos, int l, int r) {
		if (w[pos]) len[pos] = tmp[r + 1] - tmp[l];
		else len[pos] = len[lson] + len[rson];
	}
	
	void upd(int pos, int l, int r, int x, int y, int c) {
		if (x <= l && r <= y) {
			w[pos] += c; pushup(pos, l, r); return;
		}
		int mid = (l + r) >> 1;
		if (x <= mid) upd(lson, l, mid, x, y, c);
		if (y > mid) upd(rson, mid + 1, r, x, y, c);
		pushup(pos, l, r);
	}
}

int main() {
	ios::sync_with_stdio(0); cin.tie(nullptr), cout.tie(nullptr);
	cin >> T >> n >> m >> a;
	for (int i = 1; i <= a; i++) {
		cin >> q[i].t >> q[i].x1 >> q[i].y1 >> q[i].x2 >> q[i].y2;
		if (q[i].t != 3) {
			tmp[++tot] = q[i].x1, b[tot] = {q[i].x1, q[i].x2 + 1, q[i].y1, 1};
			tmp[++tot] = q[i].x2 + 1, b[tot] = {q[i].x1, q[i].x2 + 1, q[i].y2 + 1, -1};
		} else t3[++t3[0]] = i;
	}
	sort(tmp + 1, tmp + tot + 1); sort(b + 1, b + tot + 1);
	int cnt = unique(tmp + 1, tmp + tot + 1) - tmp - 1;
	ll ans = 0;
	for (int i = 1; i < tot; i++) {
		b[i].l = lower_bound(tmp + 1, tmp + cnt + 1, b[i].l) - tmp, b[i].r = lower_bound(tmp + 1, tmp + cnt + 1, b[i].r) - tmp - 1;
		SGT::upd(1, 1, cnt - 1, b[i].l, b[i].r, b[i].w);
		ans += SGT::len[1] * (b[i + 1].h - b[i].h);
	}
	for (int i = 1; i <= t3[0]; i++) {
		calc[i] = 1;
		for (int j = 1; j <= t3[0]; j++) {
			if (j != i && q[t3[i]].x1 - q[t3[j]].x1 == q[t3[i]].y1 - q[t3[j]].y1) {
				if (q[t3[j]].x1 <= q[t3[i]].x1 && q[t3[i]].x2 <= q[t3[j]].x2) {
					calc[i] = 0; break;
				}
			}
		}
		if (!calc[i]) continue;
		for (int j = 1; j < i; j++) {
			if (calc[j] && q[t3[i]].x1 - q[t3[j]].x1 == q[t3[i]].y1 - q[t3[j]].y1) {
				if (q[t3[i]].x1 <= q[t3[j]].x1 && q[t3[j]].x1 <= q[t3[i]].x2) q[t3[i]].x2 = q[t3[j]].x1 - 1, q[t3[i]].y2 = q[t3[j]].y1 - 1;
				else if (q[t3[j]].x1 <= q[t3[i]].x1 && q[t3[i]].x1 <= q[t3[j]].x2) q[t3[i]].x1 = q[t3[j]].x2 + 1, q[t3[i]].y1 = q[t3[j]].y2 + 1;
			}
		}
		ans += q[t3[i]].y2 - q[t3[i]].y1 + 1;
		for (int j = 1; j <= a; j++) {
			if (q[j].t == 1) {
				int y = q[j].y1, x = q[t3[i]].x1 + (q[j].y1 - q[t3[i]].y1);
				if (q[t3[i]].x1 <= x && x <= q[t3[i]].x2 && q[j].x1 <= x && x <= q[j].x2 && !vis[pii(x, y)]) vis[pii(x, y)] = 1, ans--;
			} else if (q[j].t == 2) {
				int x = q[j].x1, y = q[t3[i]].y1 + (q[j].x1 - q[t3[i]].x1);
				if (q[t3[i]].y1 <= y && y <= q[t3[i]].y2 && q[j].y1 <= y && y <= q[j].y2 && !vis[pii(x, y)]) vis[pii(x, y)] = 1, ans--;
			}
		}
	}
	cout << ans;
	return 0;
}