#include <bits/stdc++.h>
#define int long long
const int N = 1e5 + 5;
const int Mod = 1e9 + 7;
using namespace std;
int n, q;
map<int, int> mp;
signed main()
{
    int sum = 0;
    cin >> n >> q;
    while (n--)
    {
        int x;
        cin >> x;
        mp[x]++;
        sum += x;
    }
    cout << sum << endl;
    while (q--)
    {
        int l, r, x;
        cin >> l >> r >> x;
        auto it = mp.lower_bound(l);
        int cnt = 0;
        while (it != mp.end() && it->first <= r)
        {
            cnt += it->second;
            sum += (x - it->first) * it->second;
            it = mp.erase(it);
        }
        mp[x] += cnt;
        cout << sum << endl;
    }
    return 0;
}