#include<cstdio>
using namespace std;
const int E=1e5,o=5e5;
int n,m,a[o],b[o],c1[o],c2[o];long long ans,s1[o][4],s2[o][2];
void modify1(int id,int pos,int val,int l=0,int r=E){
	if(l==r){
		c1[id]+=val;
		for(int i=0,j=c1[id]/4,k=c1[id]%4;i<4;++i) s1[id][i]=(j+(i<k))*1ll*pos;
		return;
	}
	int md=l+r>>1;
	if(pos<=md) modify1(id<<1,pos,val,l,md);
	else modify1((id<<1)|1,pos,val,md+1,r);
	c1[id]=c1[id<<1]+c1[(id<<1)|1];
	for(int i=0,j=c1[id<<1]%4;i<4;++i) s1[id][i]=s1[id<<1][i]+s1[(id<<1)|1][(i+4-j)%4];
}
void modify2(int id,int pos,int val,int l=0,int r=E){
	if(l==r){
		c2[id]+=val;
		for(int i=0,j=c2[id]/2,k=c2[id]%2;i<2;++i) s2[id][i]=(j+(i<k))*1ll*pos;
		return;
	}
	int md=l+r>>1;
	if(pos<=md) modify2(id<<1,pos,val,l,md);
	else modify2((id<<1)|1,pos,val,md+1,r);
	c2[id]=c2[id<<1]+c2[(id<<1)|1];
	for(int i=0,j=c2[id<<1]%2;i<2;++i) s2[id][i]=s2[id<<1][i]+s2[(id<<1)|1][(i+2-j)%2];
}
inline void ins(int a,int b,int coef){
	if(a<b) modify1(1,a-b+E,coef);
	else modify2(1,a-b,coef);
	ans+=b*coef;
}
inline void slv(){
	long long res=ans+s1[1][0]+s1[1][3]-E*1ll*(c1[1]/4*2+!!(c1[1]%4));
	if(c1[1]&1) res+=s2[1][1];
	else res+=s2[1][0];
	printf("%lld\n",res);
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i) scanf("%d%d",&a[i],&b[i]),ins(a[i],b[i],1);
	slv();
	for(int t,x,y;m--;slv()) scanf("%d%d%d",&t,&x,&y),ins(a[t],b[t],-1),ins(a[t]=x,b[t]=y,1);
	return 0;
}