#include<bits/stdc++.h>
using namespace std;
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
#define rep(i,l,r) for(int i=(l); i<=(r); i++)
#define per(i,r,l) for(int i=(r); i>=(l); i--)
#define P pair<int,int>
#define ll long long
#define vi vector<int>
#define ilr int i,int l,int r
#define mi int mid=((l+r)-((l+r)%2!=0))/2;
#define ls i<<1
#define rs i<<1|1
const int N=2e5+5,inf=1e5;
P a[N];
ll sum,dif;
struct T{
    int sz; ll v[4];
    void add(int x){
        v[(++sz)%4]+=x;
    }
    void del(int x){
        v[(sz--)%4]-=x;
    }
    ll cal(){
        return v[1]+v[0];
    }
    ll cal2(){
        return v[2]+v[3];
    }
    void ot(){
        cout<<sz<<" : "; rep(i,0,3)cout<<v[i]<<" "; cout<<"ot\n";
    }
}s[N<<2];
T operator +(T a,T b){
    T c; c.sz=a.sz+b.sz;
    int tmp=((-a.sz)%4+4)%4;
    rep(i,0,3){
        c.v[i]=a.v[i]+b.v[(i+tmp)%4];
    }
    return c;
}
void ud(ilr,int x,int v){
    // cout<<l<<' '<<r<<' '<<x<<' '<<v<<endl;
    if(l==r){
        if(v==1)s[i].add(x);
        else s[i].del(x);
        return;
    }
    mi
    if(mid>=x)ud(ls,l,mid, x,v);
    else ud(rs,mid+1,r, x,v);
    s[i]=s[i<<1]+s[i<<1|1];
}
T qu(ilr,int x,int y){
    if(l>=x && r<=y)return s[i];
    mi T res={0};
    if(mid>=x)res=qu(ls,l,mid,x,y);
    if(y>mid)res=res+qu(rs,mid+1,r,x,y);
    return res;
}
ll cal(){
    T rl=qu(1,-inf,inf,-inf,0);
    ll res=rl.cal();
    T rr=qu(1,-inf,inf,1,inf);
    if(rl.sz&1)res+=rr.cal2();
    else res+=rr.cal();
    ll da=res,db=dif-res;
    // rl.ot(); rr.ot();
    // cout<<da<<' '<<db<<'\n';
    return (da-db+sum)/2;
}
signed main(){
    IOS
    int n,Q; cin>>n>>Q;
    rep(i,1,n){
        int x,y; cin>>x>>y;
        sum+=x+y; dif+=x-y;
        a[i]={x,y};
        ud(1,-inf,inf,x-y,1);
    }
    cout<<cal()<<'\n';
    rep(_,1,Q){
        int t,x,y; cin>>t>>x>>y;
        auto [px,py]=a[t];
        sum+=(x+y)-(px+py); dif+=(x-y)-(px-py);
        a[t]={x,y};
        ud(1,-inf,inf,px-py,-1);
        ud(1,-inf,inf,x-y,1);
        cout<<cal()<<'\n';
    }
}
/*
4 5
2 4
5 7
1 7
2 1
4 5 2
1 6 2
4 4 3
2 1 3
3 6 6
*/