#include <bits/stdc++.h>
using namespace std;
bool stB;
namespace SOL {

void debug(const char *msg, ...) {
#ifdef CLESIP
    va_list arg;
    static char pbString[512];
    va_start(arg,msg);
    vsprintf(pbString,msg,arg);
    cerr << "[DEBUG] " << pbString << "\n";
    va_end(arg);
#endif    
}

#define PASSED debug("PASSED (%s) LINE #%s", __FUNCTION__, __LINE__)

using i64 = long long;
using i128 = __int128_t;
template <typename T, typename L> void chkmax(T &x, L y) { if (x < y) x = y; }
template <typename T, typename L> void chkmin(T &x, L y) { if (x > y) x = y; }

const int N = 1e5 + 10;
const int V = 1e5;
int n, q, a[N], b[N], cnt[V * 2 + 10];

namespace SegmentTree {
	const int SEG_SIZE = V * 8;
	template<typename Data>
	struct SegTree {
		#define lc (x * 2)
		#define rc (x * 2 + 1)
		#define mid ((l + r) >> 1)

		Data dat[SEG_SIZE];

		void change(int x, int l, int r, int pos, const Data &k) {
			if (l == r)
				return dat[x] = k, void();
			if (pos <= mid)
				change(lc, l, mid, pos, k);
			else
				change(rc, mid + 1, r, pos, k);
			dat[x] = dat[lc] + dat[rc];
		}

		Data query(int x, int l, int r, int ql, int qr) {
			if (ql <= l && r <= qr)
				return dat[x];
			if (ql <= mid && mid < qr)
				return query(lc, l, mid, ql, qr) + query(rc, mid + 1, r, ql, qr);
			else if (ql <= mid)
				return query(lc, l, mid, ql, qr);
			else
				return query(rc, mid + 1, r, ql, qr);
		}

		#undef lc
		#undef rc
		#undef mid
	};
}

struct Node {
	int cnt;
	array<i64, 4> f;

	Node() {
		f = { 0, 0, 0, 0 };
		cnt = 0;		
	}
};

Node operator + (const Node &lhs, const Node &rhs) {
	Node ret;
	ret.cnt = lhs.cnt + rhs.cnt;
	for (int i = 0; i < 4; i ++) {
		ret.f[i] = lhs.f[i] + rhs.f[(i + lhs.cnt) % 4];
	}
	return ret;
}

Node make_node(int v, int c) {
	Node id, ret;
	id.cnt = 1;
	if (v < 0)
		id.f = { v, 0, 0, v };
	else
		id.f = { v, 0, v, 0 };
	c %= 4;
	while (c --)
		ret = ret + id;
	return ret;
}

SegmentTree::SegTree<Node> segt;

void solve() {
	cin >> n >> q;
	i64 sum = 0;
	auto query = [&]() {
		return sum + segt.dat[1].f[0];
	};
	auto modify = [&](int i, int k) {
		int pos = a[i] - b[i] + V;
		cnt[pos] += k;
		sum += b[i] * k;
		segt.change(1, 0, 2 * V, pos, make_node(a[i] - b[i], cnt[pos]));
	};
	for (int i = 1; i <= n; i ++) {
		cin >> a[i] >> b[i];
		modify(i, 1);
	}
	cout << query() << "\n";
	while (q --) {
		int i, x, y; cin >> i >> x >> y;
		modify(i, -1);
		a[i] = x, b[i] = y;
		modify(i, 1);
		cout << query() << "\n";
	}
}

}
bool edB;
signed main() {
	// cerr << "Memory: " << (&stB - &edB) / 1024.0 / 1024.0 << "MB\n";
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	SOL::solve();
	return 0;
}