#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
#define die(a) {cout<<a<<endl;return 0;}
#define dier(a) {return a;}
//const ll mod = 1000000009;
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 4000000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
//template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}
 
void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
struct seg_tree{
  vector<ll> node;
  ll n;
  seg_tree(ll N){
    n=1;
    while(n<N) n*=2;
    node.resize(2*n);
  }
  void set(ll x,ll v){
    x+=n;
    while(x){
      node[x]+=v;
      x/=2;
    }
  }
  ll prod(ll l,ll r,ll a,ll b,ll k){
    if(r<=a||b<=l) return 0;
    if(l<=a&&b<=r) return node[k];
    return prod(l,r,a,(a+b)/2,2*k)+prod(l,r,(a+b)/2,b,2*k+1);
  }
  ll prod(ll l,ll r){
    return prod(l,r,0,n,1);
  }
};
int main(){
  cincout();
  ll type;
  cin>>type;
  ll n,m,q;
  cin>>n>>m>>q;
  vector<vector<ll>> a,b,c;
  //vector<vector<ll>> r(n,vector<ll>(m));
  //vector<vector<ll>> r1(n,vector<ll>(m)),r2(n,vector<ll>(m));
  for(int i=0;i<q;i++){
    ll t;
    cin>>t;
    //t=rand()%2+1;
    if(t==1){
      ll x1,y1,x2,y2;
      cin>>x1>>y1>>x2>>y2;
      x1--;
      y1--;
      x2--;
      y2--;
      /*
      y1=rand()%m;
      y2=y1;
      x1=rand()%n;
      x2=rand()%n;
      */
      if(x1>x2) swap(x1,x2);
      a.pb({x1,y1,x2,y2});
      //cout<<1<<" "<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
      //for(int i=x1;i<=x2;i++) r1[i][y1]=1;
    }
    if(t==2){
      ll x1,y1,x2,y2;
      cin>>x1>>y1>>x2>>y2;
      x1--;
      y1--;
      x2--;
      y2--;
      /*
      x1=rand()%n;
      x2=x1;
      y1=rand()%m;
      y2=rand()%m;
      */
      if(y1>y2) swap(y1,y2);
      //cout<<2<<" "<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
      b.pb({x1,y1,x2,y2});
      //for(int i=y1;i<=y2;i++) r2[x1][i]=1;
    }
    if(t==3){
      ll x1,y1,x2,y2;
      cin>>x1>>y1>>x2>>y2;
      x1--;
      y1--;
      x2--;
      y2--;
      c.pb({x1,y1,x2,y2});
      //for(int i=0;i<=x2-x1;i++) r[x1+i][y1+i]=1;
    }
  }
  //共通を除く
  ll ans=0;
  map<ll,vector<P>> a1,b1,c1;
  {
    map<ll,vector<P>> m;
    for(auto e:a){
      m[e[1]].pb({e[0],e[2]});
    }
    a.clear();
    for(auto &e:m){
      sor(e.se);
      int i=0;
      a1[e.fi].pb({-inf,-inf});
      a1[e.fi].pb({inf,inf});
      while(i<e.se.size()){
        ll l=e.se[i].fi;
        ll r=e.se[i].se;
        while(i+1<e.se.size()&&e.se[i+1].fi<=r){
          chmax(r,e.se[i+1].se);
          i++;
        }
        ans+=r-l+1;
        a1[e.fi].pb({l,r});
        a.push_back({e.fi,l,r});
        i++;
      }
    }
  }
  {
    map<ll,vector<P>> m;
    for(auto e:b){
      m[e[0]].pb({e[1],e[3]});
    }
    b.clear();
    for(auto &e:m){
      sor(e.se);
      int i=0;
      b1[e.fi].pb({-inf,-inf});
      b1[e.fi].pb({inf,inf});
      while(i<e.se.size()){
        ll l=e.se[i].fi;
        ll r=e.se[i].se;
        while(i+1<e.se.size()&&e.se[i+1].fi<=r){
          chmax(r,e.se[i+1].se);
          i++;
        }
        b1[e.fi].pb({l,r});
        ans+=r-l+1;
        b.push_back({e.fi,l,r});
        i++;
      }
    }
  }
  for(auto &e:a1){
    sor(e.se);
  }
  for(auto &e:b1){
    sor(e.se);
  }
  {
    map<ll,vector<P>> m;
    for(auto e:c){
      m[e[1]-e[0]].pb({e[0],e[2]});
    }
    c.clear();
    for(auto &e:m){
      sor(e.se);
      int i=0;
      while(i<e.se.size()){
        ll l=e.se[i].fi;
        ll r=e.se[i].se;
        while(i+1<e.se.size()&&e.se[i+1].fi<=r){
          chmax(r,e.se[i+1].se);
          i++;
        }
        //{l,l+e.fi} から {r,r+e.fi} まで
        ans+=r-l+1;
        ll v=e.fi;
        vector<ll> xa,xb;
        for(auto e:a){
          //{e[1],e[0]} から {e[2],e[0]}
          //{l,l+e.fi} から {r,r+e.fi} まで
          ll k=e[0]-v;
          if(l<=k&&k<=r&&e[1]<=k&&k<=e[2]){
            xa.pb(k);
            ans--;
          }
        }
        for(auto e:b){
          //{e[0],e[1]} から {e[0],e[2]}
          //{l,l+e.fi} から {r,r+e.fi} まで
          ll k=e[0];
          if(l<=k&&k<=r&&e[1]<=k+v&&k+v<=e[2]){
            //cout<<e[0]<<" "<<e[1]<<" "<<e[2]<<" "<<l<<" "<<k<<" "<<r<<" "<<v<<endl;
            xb.pb(k);
            ans--;
          }
        }
        sor(xa);
        sor(xb);
        xb.pb(inf);
        for(auto e:xa) if(*lower_bound(xb.begin(),xb.end(),e)==e) ans++;
        i++;
      }
    }
  }
  //{a,b} の共通を除く
  //a を削除する -> a を追加する -> b の範囲を求める
  vector<vector<ll>> iv;
  map<ll,ll> z;
  for(auto e:a) z[e[0]]++;
  for(auto e:b){
    z[e[1]]++;
    z[e[2]]++;
  }
  ll now=0;
  for(auto &e:z){
    e.se=now;
    now++;
  }
  for(auto e:a){
    iv.push_back({e[1],1ll,z[e[0]]});
    iv.push_back({e[2]+1,0ll,z[e[0]]});
  }
  for(auto e:b){
    iv.pb({e[0],2ll,z[e[1]],z[e[2]]});
  }
  seg_tree seg(z.size());
  sor(iv);
  ll cnt=0;
  //cout<<ans<<endl;
  for(auto e:iv){
    if(e[1]==0){
      //cout<<e[0]<<" "<<e[1]<<" "<<e[2]<<endl;
      seg.set(e[2],-1);
    }
    if(e[1]==1){
      //cout<<e[0]<<" "<<e[1]<<" "<<e[2]<<endl;
      seg.set(e[2],1);
    }
    if(e[1]==2){
      //cout<<e[0]<<" "<<e[1]<<" "<<e[2]<<" "<<e[3]<<" "<<seg.prod(e[2],e[3]+1)<<endl;
      ans-=seg.prod(e[2],e[3]+1);
    }
  }
  cout<<ans<<endl;
  /*
  ll ans2=0;
  for(int i=0;i<n;i++){
    for(int j=0;j<m;j++) ans2+=r[i][j];
  }
  cout<<ans2<<endl;
  */
}