#include <iostream>
#include <algorithm>
#include <vector>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXQ = 1e5 + 10, MAXN = 2e5 + 10, INF = 2e9;

int N, M, q;
ll sumA, sumB, sumC, sumAB, sumAC, sumBC, sumABC;

struct Opt
{
    int t, l, r;
    bool operator < (const Opt u) const {return t == u.t ? r < u.r : t < u.t;}
}rw[MAXQ], cl[MAXQ], dg[10];
int rwt, clt, dgt;

int tx[MAXN], ty[MAXN], n, m;

pair <int, int> st[MAXN];
int top;
vector <pair <int, int>> a[MAXN], b[MAXN];

struct Qry
{
    int t, x, f;
    bool operator < (const Qry u) const {return t < u.t;}
}qt[MAXN];
int tot;

int tr[MAXN << 2];
inline void Pushup(int cur) {tr[cur] = tr[cur << 1] + tr[cur << 1 | 1];}
void Update(int cur, int l, int r, int x, int k)
{
    if (x < l || x > r) return;
    if (l == r) tr[cur] += k;
    else
    {
        int mid = l + r >> 1;
        if (x <= mid) Update(cur << 1, l, mid, x, k);
        else Update(cur << 1 | 1, mid + 1, r, x, k);
        Pushup(cur);
    }
}
int Query(int cur, int l, int r, int x, int y)
{
    if (x <= l && r <= y) return tr[cur];
    int mid = l + r >> 1, res = 0;
    if (x <= mid) res += Query(cur << 1, l, mid, x, y);
    if (y > mid) res += Query(cur << 1 | 1, mid + 1, r, x, y);
    return res;
}

int ux[MAXN], uy[MAXN], xx, yy;

int main()
{
    // freopen("ex_color/ex_color7.in", "r", stdin);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int CASE; Read(CASE);
    Read(N), Read(M), Read(q);
    for (int i = 1, op, x1, y1, x2, y2; i <= q; i++)
    {
        Read(op), Read(x1), Read(y1), Read(x2), Read(y2);
        if (op == 1) rw[++rwt] = Opt{y1, min(x1, x2), max(x1, x2)};
        else if (op == 2) cl[++clt] = Opt{x1, min(y1, y2), max(y1, y2)};
        else dg[++dgt] = Opt{y1 - x1, x1, x2};
        tx[++n] = x1, tx[++n] = x2, ty[++m] = y1, ty[++m] = y2;
    }
    sort(tx + 1, tx + n + 1), n = unique(tx + 1, tx + n + 1) - tx - 1;
    sort(ty + 1, ty + m + 1), m = unique(ty + 1, ty + m + 1) - ty - 1;
    sort(rw + 1, rw + rwt + 1), sort(cl + 1, cl + clt + 1), sort(dg + 1, dg + dgt + 1);
    for (int i = 1; i <= rwt; i++)
    {
        rw[i].t = lower_bound(ty + 1, ty + m + 1, rw[i].t) - ty;
        rw[i].l = lower_bound(tx + 1, tx + n + 1, rw[i].l) - tx;
        rw[i].r = lower_bound(tx + 1, tx + n + 1, rw[i].r) - tx;
    }
    for (int i = 1; i <= clt; i++)
    {
        cl[i].t = lower_bound(tx + 1, tx + n + 1, cl[i].t) - tx;
        cl[i].l = lower_bound(ty + 1, ty + m + 1, cl[i].l) - ty;
        cl[i].r = lower_bound(ty + 1, ty + m + 1, cl[i].r) - ty;
    }
    for (int i = 1; i <= dgt; i++)
    {
        dg[i].l = lower_bound(tx + 1, tx + n + 1, dg[i].l) - tx;
        dg[i].r = lower_bound(tx + 1, tx + n + 1, dg[i].r) - tx;
    }

    for (int l = 1, r; l <= rwt; l = r + 1)
    {
        r = l;
        while (r < rwt && rw[r + 1].t == rw[l].t) r++;
        top = 0;
        for (int i = l, cur; i <= r; i++)
        {
            cur = rw[i].l;
            while (top && st[top].second >= cur) cur = min(cur, st[top].first), top--;
            st[++top] = make_pair(cur, rw[i].r);
        }
        for (int i = 1; i <= top; i++) a[rw[l].t].push_back(st[i]), sumA += tx[st[i].second] - tx[st[i].first] + 1;
        // cout << rw[l].t << ":\n";
        // for (int i = 1; i <= top; i++) cout << st[i].first << ' ' << st[i].second << '\n';
        for (int i = 1; i <= top; i++)
        {
            if (st[i].first > 1) qt[++tot] = Qry{st[i].first - 1, rw[l].t, -1};
            qt[++tot] = Qry{st[i].second, rw[l].t, 1};
        }
    }
    for (int l = 1, r; l <= clt; l = r + 1)
    {
        r = l;
        while (r < clt && cl[r + 1].t == cl[l].t) r++;
        top = 0;
        for (int i = l, cur; i <= r; i++)
        {
            cur = cl[i].l;
            while (top && st[top].second >= cur) cur = min(cur, st[top].first), top--;
            st[++top] = make_pair(cur, cl[i].r);
        }
        for (int i = 1; i <= top; i++) b[cl[l].t].push_back(st[i]), sumB += ty[st[i].second] - ty[st[i].first] + 1;
    }
    int _dgt = dgt; dgt = 0;
    for (int l = 1, r; l <= _dgt; l = r + 1)
    {
        r = l;
        while (r < _dgt && dg[r + 1].t == dg[l].t) r++;
        top = 0;
        for (int i = l, cur; i <= r; i++)
        {
            cur = dg[i].l;
            while (top && st[top].second >= cur) cur = min(cur, st[top].first), top--;
            st[++top] = make_pair(cur, dg[i].r);
        }
        int T = dg[l].t;
        for (int i = 1; i <= top; i++) dg[++dgt] = Opt{T, st[i].first, st[i].second}, sumC += tx[st[i].second] - tx[st[i].first] + 1;
        // cout << T << ":\n";
        // for (int i = 1; i <= top; i++) cout << tx[st[i].first] << ' ' << tx[st[i].second] << "\n";
    }

    sort(qt + 1, qt + tot + 1);
    for (int i = 1, j = 1; i <= n && j <= tot; i++)
    {
        for (auto x : b[i]) Update(1, 1, m, x.first, 1), Update(1, 1, m, x.second + 1, -1);
        while (j <= tot && qt[j].t == i) sumAB += Query(1, 1, m, 1, qt[j].x) * qt[j].f, j++;
    }

    for (int i = 1; i <= dgt; i++)
    {
        xx = yy = 0;
        for (int j = dg[i].l; j <= dg[i].r; j++)
        {
            int cur = lower_bound(ty + 1, ty + m + 1, dg[i].t + tx[j]) - ty;
            int pos = upper_bound(b[j].begin(), b[j].end(), make_pair(cur, INF)) - b[j].begin() - 1;
            bool flag = 0;
            for (int k = max(0, pos - 2); k <= pos; k++)
                if (ty[b[j][k].first] <= dg[i].t + tx[j] && dg[i].t + tx[j] <= ty[b[j][k].second]) {flag = 1; break;}
            if (flag) sumBC++, uy[++yy] = tx[j] - tx[dg[i].l];
        }
        int bg = lower_bound(ty + 1, ty + m + 1, dg[i].t + tx[dg[i].l]) - ty, ed = lower_bound(ty + 1, ty + m + 1, dg[i].t + tx[dg[i].r]) - ty;
        for (int j = bg; j <= ed; j++)
        {
            int cur = lower_bound(tx + 1, tx + n + 1, ty[j] - dg[i].t) - tx;
            int pos = upper_bound(a[j].begin(), a[j].end(), make_pair(cur, INF)) - a[j].begin() - 1;
            bool flag = 0;
            for (int k = max(0, pos - 2); k <= pos; k++)
                if (tx[a[j][k].first] <= ty[j] - dg[i].t && ty[j] - dg[i].t <= tx[a[j][k].second]) {flag = 1; break;}
            if (flag) sumAC++, ux[++xx] = ty[j] - ty[bg];
        }
        for (int j = 1, k = 0; j <= xx; j++)
        {
            while (k < yy && uy[k + 1] <= ux[j]) k++;
            if (k && uy[k] == ux[j]) sumABC++;
        }
    }
    // cout << sumA << ' ' << sumB << ' ' << sumC << '\n';
    cout << sumA + sumB + sumC - sumAB - sumBC - sumAC + sumABC << '\n';
    return 0;
}