// clang-format off
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define st first
#define nd second
#define bit(s,x) (((s)>>(x))&1)
#define ctz(s) __builtin_popcount(s)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull; 
//typedef __int128 i128; 
typedef long double ld;
typedef pair<int,int> pii; typedef pair<ll,int> pli; typedef pair<ll,ll> pll; typedef pair<int,ll> pil;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
inline void write(ll x){ if(x<0) putchar('-'),x=-x; if(x>9) write(x/10); putchar(x%10+'0'); }
// remember to change!!!
const int mod=998244353;
inline void plust(int &x,int y,int p=mod){x=x+y<p?x+y:x+y-p;}
inline void mul(int &x,int y,int p=mod){x=1ll*x*y%p;}
inline int fp(int x,ll p=mod-2,int m=mod,int res=1){
	for(;p;p>>=1){if(p&1)mul(res,x,m);mul(x,x,m);}
	return res;
}
const int N=1e5+10;
const int INF=0x3fffffff;
// clang-format on
pii a[N];
struct info1{ll a,b;int siz;}t[1<<18];
info1 operator +(info1 A,info1 B){
	if(A.siz&1)return {A.a+B.b,A.b+B.a,A.siz+B.siz};
	else return {A.a+B.a,A.b+B.b,A.siz+B.siz};
}
info1 operator -(info1 A,info1 B){
	if(A.siz&1 == B.siz&1)return {A.a-B.a,A.b-B.b,A.siz-B.siz};
	else return {A.a-B.b,A.b-B.a,A.siz-B.siz};
}
struct info2{ll a[4];int siz;}p[1<<18];
info2 operator +(info2 A,info2 B){
	info2 res;res.siz = A.siz + B.siz;
	for(int i=0;i<4;++i)res.a[i] = A.a[i] + B.a[(i+A.siz)%4];
	return res;
}
info2 operator -(info2 A,info2 B){
	info2 res;res.siz = A.siz - B.siz;
	for(int i=0;i<4;++i)res.a[i] = A.a[i] - B.a[(i+A.siz-B.siz)%4];
	return res;
}
#define mid ((l+r)>>1)
inline void update1(int x,int l,int r,int nx,info1 k,int op){
	if(l==r){
		if(op==1)t[x] = t[x] + k;
		else t[x] = t[x] - k;
		return ;
	}
	if(nx<=mid)update1(x<<1,l,mid,nx,k,op);
	else update1(x<<1|1,mid+1,r,nx,k,op);
	t[x] = t[x<<1] + t[x<<1|1];
}
inline void update2(int x,int l,int r,int nx,info2 k,int op){
	if(l==r){
		if(op==1)p[x] = p[x] + k;
		else p[x] = p[x] - k;
		return ;
	}
	if(nx<=mid)update2(x<<1,l,mid,nx,k,op);
	else update2(x<<1|1,mid+1,r,nx,k,op);
	p[x] = p[x<<1|1] + p[x<<1];
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	int n=read(),T=read();
	for(int i=1;i<=n;++i){
		a[i].st=read(),a[i].nd=read();
		if(a[i].st >= a[i].nd)update1(1,0,n,a[i].st-a[i].nd,{a[i].st,a[i].nd,1},1);
		else update2(1,0,n,a[i].nd-a[i].st,{{a[i].st,a[i].nd,a[i].nd,a[i].st},1},1);
	}
	int s=p[1].siz;
	printf("%lld\n",p[1].a[0] + ((s&1)?t[1].b:t[1].a));
	while(T--){
		int i=read();
		if(a[i].st >= a[i].nd)update1(1,0,n,a[i].st-a[i].nd,{a[i].st,a[i].nd,1},-1);
		else update2(1,0,n,a[i].nd-a[i].st,{{a[i].st,a[i].nd,a[i].nd,a[i].st},1},-1);
		a[i].st=read(),a[i].nd=read();
		if(a[i].st >= a[i].nd)update1(1,0,n,a[i].st-a[i].nd,{a[i].st,a[i].nd,1},1);
		else update2(1,0,n,a[i].nd-a[i].st,{{a[i].st,a[i].nd,a[i].nd,a[i].st},1},1);
		s=p[1].siz;
		printf("%lld\n",p[1].a[0] + ((s&1)?t[1].b:t[1].a));
	}
    return 0;
}