#include<bits/stdc++.h>
#define ll long long
#define mid ((l+r)>>1)
#define MAX_N 200010
#define N 200000
using namespace std;
ll c[MAX_N<<1];
struct node
{
	ll siz,sum[4];
}s[MAX_N<<3];
namespace SEG
{
	void up(node&p,node l,node r)
	{
		p.siz=l.siz+r.siz;
		for(ll i=0;i<4;++i)
			p.sum[i]=l.sum[i]+r.sum[(i-l.siz%4+4)%4];
	}
	void build(ll p,ll l,ll r)
	{
		if(l==r)
		{
			if(!c[l])return;
			s[p].siz=c[l];
			for(ll i=0;i<4;++i)s[p].sum[i]=(c[l]/4+((c[l]-1)%4>=i&&c[l]))*(l-N);
			return;
		}
		build(p<<1,l,mid);
		build(p<<1|1,mid+1,r);
		up(s[p],s[p<<1],s[p<<1|1]);
	}
	node query(ll p,ll l,ll r,ll x,ll y)
	{
		if(x<=l&&r<=y)return s[p];
		node a={0,{0}},b={0,{0}};
		if(x<=mid)a=query(p<<1,l,mid,x,y);
		if(y>mid)b=query(p<<1|1,mid+1,r,x,y);
		up(a,a,b);
		return a;
	}
	void change(ll p,ll l,ll r,ll x,ll c)
	{
		if(l==r)
		{
			s[p].siz+=c;
			if(c==1)s[p].sum[(s[p].siz-1)%4]+=l-N;
			else s[p].sum[s[p].siz%4]-=l-N;
			return;
		}
		if(x<=mid)change(p<<1,l,mid,x,c);
		else change(p<<1|1,mid+1,r,x,c);
		up(s[p],s[p<<1],s[p<<1|1]);
	}
}
ll a[MAX_N],b[MAX_N];
int main()
{
    ios::sync_with_stdio(false);cin.tie(0);
    ll n,m;cin>>n>>m;
    multiset<ll>s;ll sumb=0;
	for(ll i=1;i<=n;++i)cin>>a[i]>>b[i],c[a[i]-b[i]+N]++,sumb+=b[i];
	SEG::build(1,1,2*N);
	node l=SEG::query(1,1,2*N,1,N),r=SEG::query(1,1,2*N,N+1,2*N);
	cout<<l.sum[0]+l.sum[3]+r.sum[l.siz%2==0?0:1]+r.sum[l.siz%2==0?2:3]+sumb<<endl;
	
	while(m--)
	{
		ll t,x,y;
		cin>>t>>x>>y;
		SEG::change(1,1,2*N,a[t]-b[t]+N,-1);sumb-=b[t];
		a[t]=x,b[t]=y;
		SEG::change(1,1,2*N,a[t]-b[t]+N,1);sumb+=b[t];
		node l=SEG::query(1,1,2*N,1,N),r=SEG::query(1,1,2*N,N+1,2*N);
		cout<<l.sum[0]+l.sum[3]+r.sum[l.siz%2==0?0:1]+r.sum[l.siz%2==0?2:3]+sumb<<endl;
	}
	return 0;
}
/*
-2 -2 -6 1//
-6 -2 -2 1
*/