#include <bits/stdc++.h>

using ll = long long;

const int _ = 100005;

std::tuple<int, int, int> row[_], col[_], diag[_];

int pts[_];
std::pair<int, int> chg[_ * 2];

int SZ;
int fw[_];
void add(int k, int x) {
	for (; k <= SZ; k += k & -k) fw[k] += x;
}
int qry(int k) {
	int ret = 0;
	for (; k; k &= k - 1) ret += fw[k];
	return ret;
}

std::tuple<int, int, int> tmp[_];
ll ans;
void clear(int &S, std::tuple<int, int, int> seg[]) {
	if (!S) return;
	std::sort(seg + 1, seg + S + 1);
	int T = 0;
	tmp[++T] = seg[1];
	for (int i = 2; i <= S; ++i) {
		if (std::get<0>(tmp[T]) != std::get<0>(seg[i])) tmp[++T] = seg[i];
		else if (std::get<2>(tmp[T]) < std::get<1>(seg[i])) tmp[++T] = seg[i];
		else std::get<2>(tmp[T]) = std::max(std::get<2>(tmp[T]), std::get<2>(seg[i]));
	}
	S = T;
	std::copy(tmp + 1, tmp + S + 1, seg + 1);
	for (int i = 1; i <= T; ++i) ans += std::get<2>(tmp[i]) - std::get<1>(tmp[i]);
}

int loc(int x) { return std::upper_bound(pts + 1, pts + SZ + 1, x) - pts - 1; }

int rp[_], cp[_], mer[_];

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);

	int id, w, h, N;
	std::cin >> id >> w >> h >> N;
	int R = 0, C = 0, D = 0;
	while (N--) {
		int t, x1, y1, x2, y2;
		std::cin >> t >> x1 >> y1 >> x2 >> y2;
		if (t == 1) {
			row[++R] = std::make_tuple(y1, x1, x2 + 1);
		} else if (t == 2) {
			col[++C] = std::make_tuple(x1, y1, y2 + 1);
		} else {
			diag[++D] = std::make_tuple(x1 - y1, y1, y2 + 1);
		}
	}
	clear(R, row);
	clear(C, col);
	clear(D, diag);

	int CG = 0;
	SZ = R;
	for (int i = 1; i <= R; ++i) {
		pts[i] = std::get<0>(row[i]);
		chg[++CG] = std::make_pair(std::get<1>(row[i]), -i);
		chg[++CG] = std::make_pair(std::get<2>(row[i]), -i);
	}
	for (int i = 1; i <= C; ++i) chg[++CG] = std::make_pair(std::get<0>(col[i]), i);

	std::sort(chg + 1, chg + CG + 1);
	for (int i = 1; i <= CG; ++i) {
		if (chg[i].second > 0) {
			int id = chg[i].second;
			int cur = qry(loc(std::get<2>(col[id]) - 1)) - qry(loc(std::get<1>(col[id]) - 1));
			ans -= cur;
		} else {
			int id = -chg[i].second;
			if (chg[i].first == std::get<1>(row[id])) add(loc(std::get<0>(row[id])), 1);
			else add(loc(std::get<0>(row[id])), -1);
		}
	}

	for (int i = 1; i <= D; ++i) {
		int RP = 0, CP = 0;
		int delt, ll, rr;
		std::tie(delt, ll, rr) = diag[i];
		for (int j = 1; j <= R; ++j) {
			int y, l, r;
			std::tie(y, l, r) = row[j];
			int x = delt + y;
			if (x < l || x >= r) continue;
			if (y < ll || y >= rr) continue;
			rp[++RP] = x;
		}
		for (int j = 1; j <= C; ++j) {
			int x, l, r;
			std::tie(x, l, r) = col[j];
			int y = x - delt;
			if (y < ll || y >= rr) continue;
			if (y < l || y >= r) continue;
			cp[++CP] = x;
		}
		std::merge(rp + 1, rp + RP + 1, cp + 1, cp + CP + 1, mer + 1);
		int siz = std::unique(mer + 1, mer + RP + CP + 1) - mer - 1;
		ans -= siz;
	}

	std::cout << ans << '\n';

	return 0;
}