#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
using namespace std;
const int N = 2000 + 10;
int n, m, k, x, l, a, b, c, d, s;
char G[N][N];
int main() {
    freopen("jxfgx.in", "r", stdin);
    freopen("jxfgx.out", "w", stdout);
    scanf("%d %d %d", &n, &m, &k);
    for(int i=0; i<k; i++) {
        scanf("%d %d %d %d %d", &x, &a, &b, &c, &d);
        l = (x == 1) ? 1 : -1;
        for(int u=a; u<=c; u++)
            for(int v=b; v<=d; v++)
                G[u][v] += l;
        /*for(int u=1; u<=n; u++) {
            for(int v=1; v<=m; v++)
                fprintf(stderr, "%d", G[u][v]);
            fprintf(stderr, "\n");
        } fprintf(stderr, "\n");*/
        s = 0;
        for(int u=1; u<=n; u++)
            for(int v=1; v<=m; v++)
                s += G[u][v] > 0;
        printf("%d\n", s);
    }
    return 0;
}