//qoj6755
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 2e5 + 10;
int n, m, Q, q;
struct rec{
	int x, y, xx, yy;
} qr[N];
vector<rec> cur;
ll ans = 0;
int bx[N], by[N], bc;

struct scanline{
	int l, r, val;
};
vector<scanline> g[N]; 

struct node{
	int tag, mn, mv, vl;
} t[N*4];

void build(int p, int l, int r){
	t[p].vl = t[p].mv = bx[r+1] - bx[l];
	if(l != r){
		int mid = l + r >> 1;
		build(p<<1, l, mid);
		build(p<<1|1, mid+1, r);
	}
}
void add(int p, int l, int r, int ql, int qr, int v){
	if(qr < l || r < ql){
		return;
	} else if(ql <= l && r <= qr){
		t[p].mn += v;
		t[p].tag += v;
	} else {
		int mid = l + r >> 1;
		t[p<<1].tag += t[p].tag;
		t[p<<1].mn += t[p].tag;
		t[p<<1|1].tag += t[p].tag;
		t[p<<1|1].mn += t[p].tag;
		t[p].tag = 0;
		add(p<<1, l, mid, ql, qr, v);
		add(p<<1|1, mid+1, r, ql, qr, v);
		if(t[p<<1].mn == t[p<<1|1].mn){
			t[p].mn = t[p<<1].mn;
			t[p].mv = t[p<<1].mv + t[p<<1|1].mv;
		} else if(t[p<<1].mn < t[p<<1|1].mn){
			t[p].mn = t[p<<1].mn;
			t[p].mv = t[p<<1].mv;
		} else {
			t[p].mn = t[p<<1|1].mn;
			t[p].mv = t[p<<1|1].mv;
		}
	}
}

void smx(){
	if(!q){
		return;
	}
	for(int i = 1; i <= q; ++ i){
		++ qr[i].xx;
		++ qr[i].yy;
		bx[bc+1] = qr[i].x;
		bx[bc+2] = qr[i].xx;
		by[bc+1] = qr[i].y;
		by[bc+2] = qr[i].yy;
		bc += 2;
	}
	sort(bx + 1, bx + bc + 1);
	int mx = unique(bx + 1, bx + bc + 1) - bx - 1;
	sort(by + 1, by + bc + 1);
	int my = unique(by + 1, by + bc + 1) - by - 1;
	for(int i = 1; i <= q; ++ i){
		qr[i].x = lower_bound(bx + 1, bx + mx + 1, qr[i].x) - bx;
		qr[i].xx = lower_bound(bx + 1, bx + mx + 1, qr[i].xx) - bx;
		qr[i].y = lower_bound(by + 1, by + my + 1, qr[i].y) - by;
		qr[i].yy = lower_bound(by + 1, by + my + 1, qr[i].yy) - by;
		g[qr[i].y].push_back({qr[i].x, qr[i].xx, 1});
		g[qr[i].yy].push_back({qr[i].x, qr[i].xx, -1});
	}
	build(1, 1, mx-1);
	for(int i = 1; i < my; ++ i){
		for(auto p : g[i]){
			add(1, 1, mx-1, p.l, p.r-1, p.val);
		}
		ans += 1ll * (by[i+1] - by[i]) * (bx[mx] - bx[1] - (t[1].mn ? 0 : t[1].mv));
	}
}

int main(){
	scanf("%d", &n);
	scanf("%d%d%d", &n, &m, &Q);
	for(int i = 1; i <= Q; ++ i){
		int op, x, y, xx, yy;
		scanf("%d%d%d%d%d", &op, &x, &y, &xx, &yy);
		if(x > xx){
			swap(x, xx);
		}
		if(y > yy){
			swap(y, yy);
		}
		if(op != 3){
			qr[++q] = {x, y, xx, yy};
		} else {
			cur.push_back({x, y, xx, yy});
		}
	}
	int k = cur.size();
	for(int p = 0; p < k; ++ p){
		for(int i = 0; i < k; ++ i){
			for(int j = 0; j < k; ++ j){
				if(cur[i].x == -1 || cur[j].x == -1 || i == j){
					continue;
				}
				if(cur[i].y - cur[i].x != cur[j].y - cur[j].x){
					continue;
				}
				if(cur[i].x > cur[j].xx || cur[j].x > cur[i].xx){
					continue;
				}
				cur[i].x = min(cur[i].x, cur[j].x);
				cur[i].y = min(cur[i].y, cur[j].y);
				cur[i].xx = max(cur[i].xx, cur[j].xx);
				cur[i].yy = max(cur[i].yy, cur[j].yy);
				cur[j].x = -1;
			}
		}
	}
	for(int i = 0; i < k; ++ i){
		if(cur[i].x == -1){
			continue;
		}
		map<int, int> mp;
		mp.clear();
		int cnt = 0, b = cur[i].y - cur[i].x;
		for(int j = 1; j <= q; ++ j){
			if(qr[j].x == qr[j].xx){
				int x = qr[j].x, y = qr[j].x + b;
				if(x >= cur[i].x && x <= cur[i].xx && 
				   y >= qr[j].y  && y <= qr[j].yy  && !mp[x]){
					mp[x] = 1;
					++ cnt;
				}
			} else {
				int x = qr[j].y - b, y = qr[j].y;
				if(y >= cur[i].y && y <= cur[i].yy && 
				   x >= qr[j].x && x <= qr[j].xx && !mp[x]){
				   	mp[x] = 1;
				   	++ cnt;
				}
			}
		}
		ans += cur[i].xx - cur[i].x + 1 - cnt;
	}
	smx();
	printf("%lld\n", ans);
	return 0;
}