#include<cstdio>

 #include<iostream>

 #include<cmath>

 #include<algorithm>

 #include<cstring>

 #include<cstdlib>

 #include<cctype>

 #include<vector>

 #include<stack>

 #include<queue>

 using namespace std;

 #define enter puts("")

 #define space putchar(' ')

 #define Mem(a, x) memset(a, x, sizeof(a))

 #define rg register

 typedef long long ll;

 typedef double db;

 const int INF = 0x3f3f3f3f;

 const db eps = 1e-;

 const int maxn = 1e5 + ;

 inline ll read()

 {

     ll ans = ;

     char ch = getchar(), last = ' ';

     while(!isdigit(ch)) {last = ch; ch = getchar();}

     while(isdigit(ch)) {ans = ans *  + ch - ''; ch = getchar();}

     if(last == '-') ans = -ans;

     return ans;

 }

 inline void write(ll x)

 {

     if(x < ) x = -x, putchar('-');

     if(x >= ) write(x / );

     putchar(x %  + '');

 }

 int n, m, q;

 struct Tree

 {

     int l[maxn << ], r[maxn << ], sum[maxn << ];

     Tree()

     {

         Mem(l, ); Mem(r, );

         Mem(sum, );

     }

     void build(int L, int R, int now)

     {

         l[now] = L; r[now] = R;

         if(L == R) return;

         int mid = (L + R) >> ;

         build(L, mid, now << );

         build(mid + , R, now <<  | );

     }

     void update(int idx, int now)

     {

         if(l[now] == r[now]) {sum[now] ^= ; return;}

         int mid = (l[now] + r[now]) >> ;

         if(idx <= mid) update(idx, now << );

         else update(idx, now <<  | );

         sum[now] = sum[now << ] + sum[now <<  | ];

     }

     int query(int L, int R, int now)

     {

         if(L == l[now] && R == r[now]) return sum[now];

         int mid = (l[now] + r[now]) >> ;

         if(R <= mid) return query(L, R, now << );

         else if(L > mid) return query(L, R, now <<  | );

         else return query(L, mid, now << ) + query(mid + , R, now <<  | );

     }

 }X, Y;

 int main()

 {

     n = read(); m = read(); q = read();

     X.build(, n, ); Y.build(, m, );

     for(int i = ; i <= q; ++i)

     {

         int d = read();

         if(d == )

         {

             int x = read(), y = read();

             X.update(x, ); Y.update(y, );

         }

         else

         {

             int xa = read(), ya = read(), xb = read(), yb = read();

             int a = X.query(xa, xb, ), b = Y.query(ya, yb, );

             write((ll)a * (ll)(yb - ya + ) + (ll)b * (ll)(xb - xa + ) - (ll)a * b * );

             enter;

         }

     }

     return ;

 }