#include #include #include #include #include #include using namespace std; using namespace atcoder; using ll = long long; using mint = modint998244353; using vi = vector; using vvi = vector; using vvvi = vector; using vll = vector; using vvll = vector; using vvvll = vector; using vmi = vector; using vvmi = vector; using vvvmi = vector; #define all(a) (a).begin(), (a).end() #define rep2(i, m, n) for (int i = (m); i < (n); ++i) #define rep(i, n) rep2(i, 0, n) #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) ll op(ll a, ll b){ return a+b; } ll e(){return 0;} void solve(){ } int main(){ int n, m; cin >> n >> m; segtree segl(m), segr(m), seg3(m); vll vl(n), vr(n), va(n), vh(n); rep(i, n){ cin >> va[i] >> vl[i] >> vr[i]; vl[i]--; vr[i]--; segl.set(vl[i], segl.get(vl[i])+1); segr.set(vr[i], segr.get(vr[i])+1); seg3.set(i, va[i]); vh[i] = i; } ll gp = 0; rep(i, n){ gp += va[i]*(vr[i] - vl[i] + 1) - seg3.prod(vl[i], vr[i]+1); } int Q; cin >> Q; while(Q--){ ll x, y, l, r; cin >> x >> y >> l >> r; x--; y--; l--; r--; segl.set(vl[x], segl.get(vl[x])-1); segr.set(vr[x], segr.get(vr[x])-1); ll pre = segl.prod(0, vh[x]+1) - segr.prod(0, vh[x]); gp += va[x]*pre; //segl.set(vl[x], segl.get(vl[x])-1); segr.set(vr[x], segr.get(vr[x])-1); //segl.set(l, segl.get(l)+1); segr.set(r, segr.get(r)+1); ll nx = segl.prod(0, y+1) - segr.prod(0, y); gp -= va[x]*nx; ll b = va[x]*(vr[x] - vl[x] + 1) - seg3.prod(vl[x], vr[x]+1); //ll b = va[x]*(vr[x] - vl[x] + 1); seg3.set(vh[x], 0); seg3.set(y, va[x]); gp += va[x]*(r-l+1) - seg3.prod(l, r+1) - b; //gp += va[x]*(r-l+1) - b; segl.set(l, segl.get(l)+1); segr.set(r, segr.get(r)+1); vl[x] = l; vr[x] = r; vh[x] = y; cout << gp << endl; } return 0; }