#include<bits/stdc++.h>
#define N 200005
#define int long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,m,q,k,op,c[N],p[N],sum,x,y,z,ans,last;
multiset<int>s[N],ma,se;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ckmax(int &x,int y){if(y>x)x=y;}
void ckmin(int &x,int y){if(y<x)x=y;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
void del(int x){
    sum-=*(--s[x].end());
    ma.erase(ma.find(*(--s[x].end())));
    se.erase(se.find(s[x].size()>1?*(--(--s[x].end())):0));
}
void ins(int x){
    sum+=*(--s[x].end());
    ma.insert(*(--s[x].end()));
    se.insert(s[x].size()>1?*(--(--s[x].end())):0);
}
int gs(){return max(sum,sum+*(--se.end())-*ma.begin());}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    freopen("Pens.in","r",stdin);freopen("Pens.out","w",stdout);
    n=read();m=read();q=read();
    fo(i,1,n)c[i]=read(),p[i]=read(),s[c[i]].insert(p[i]);
    fo(i,1,m)ins(i);
    printf("%lld\n",gs());
    while(q--){
        op=read();x=read();y=read();
        if(op==1){
            del(c[x]);del(y);
            s[c[x]].erase(s[c[x]].find(p[x]));
            s[y].insert(p[x]);
            ins(c[x]);ins(y);
            c[x]=y;
        }
        else{
            del(c[x]);
            s[c[x]].erase(s[c[x]].find(p[x]));
            s[c[x]].insert(y);
            ins(c[x]);
            p[x]=y;
        }
        printf("%lld\n",gs());
    }
    return 0;
}