using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var map = NArr(n);
        var q = NN;
        var query = NArr(q);

        // 家iを地元とみなしている岩井星人の数
        var rcnt = new FenwickTree(m + 2);
        // 各家のレート
        var rate = new FenwickTree(m + 2);
        for (var i = 0; i < n; ++i)
        {
            rcnt.Add(map[i][1], 1);
            rcnt.Add(map[i][2] + 1, -1);
            rate.Add(i + 1, map[i][0]);
        }
        var home = new int[n];
        var range = new (int l, int r)[n];
        var sum = 0L;
        for (var i = 0; i < n; ++i)
        {
            home[i] = i + 1;
            range[i] = (map[i][1], map[i][2]);
            sum += map[i][0] * (map[i][2] - map[i][1] + 1L) - rate.Sum(map[i][2]) + rate.Sum(map[i][1] - 1);
        }
        var ans = new long[q];
        for (var i = 0; i < q; ++i)
        {
            var x = query[i][0] - 1;
            sum += map[x][0] * (rcnt.Sum(home[x]) - (range[x].l <= home[x] && home[x] <= range[x].r ? 1 : 0));
            sum -= map[x][0] * (range[x].r - range[x].l + 1L) - rate.Sum(range[x].r) + rate.Sum(range[x].l - 1);
            rcnt.Add(range[x].l, -1);
            rcnt.Add(range[x].r + 1, 1);
            rate.Add(home[x], -map[x][0]);
            home[x] = query[i][1];
            range[x] = (query[i][2], query[i][3]);
            rcnt.Add(range[x].l, 1);
            rcnt.Add(range[x].r + 1, -1);
            rate.Add(home[x], map[x][0]);
            sum -= map[x][0] * (rcnt.Sum(home[x]) - (range[x].l <= home[x] && home[x] <= range[x].r ? 1 : 0));
            sum += map[x][0] * (range[x].r - range[x].l + 1L) - rate.Sum(range[x].r) + rate.Sum(range[x].l - 1);
            ans[i] = sum;
        }
        WriteLine(string.Join("\n", ans));
    }
    class FenwickTree
    {
        int size;
        long[] tree;
        public FenwickTree(int size)
        {
            this.size = size;
            tree = new long[size + 2];
        }
        public void Add(int index, long value)
        {
            ++index;
            for (var x = index; x <= size; x += (x & -x)) tree[x] += value;
        }
        /// <summary>先頭からindexまでの和(include index)</summary>
        public long Sum(int index)
        {
            if (index < 0) return 0;
            ++index;
            var sum = 0L;
            for (var x = index; x > 0; x -= (x & -x)) sum += tree[x];
            return sum;
        }
        public long Get(int index)
        {
            if (index == 0) return Sum(0);
            return Sum(index) - Sum(index - 1);
        }
        /// <summary>Sum(x) >= value となる最小のxを求める</summary>
        // 各要素は非負であること
        public int LowerBound(long value)
        {
            if (value < 0) return -1;
            var x = 0;
            var b = 1;
            while (b * 2 <= size) b <<= 1;
            for (var k = b; k > 0; k >>= 1)
            {
                if (x + k <= size && tree[x + k] < value)
                {
                    value -= tree[x + k];
                    x += k;
                }
            }
            return x;
        }
    }
}