#include <bits/stdc++.h>
using namespace std;
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
const int MAX = 2e5 + 5;
const long long INF = 1e18;
struct node {
long long a[3][3];
node() {
memset(a, -0x3f, sizeof a);
a[2][2] = 0;
}
node (long long val) {
memset(a, -0x3f, sizeof a);
a[2][0] = a[0][2] = val;
a[2][1] = a[1][2] = - val;
a[2][2] = 0;
}
auto & operator [] (int i) { return a[i]; }
const auto & operator [] (int i) const { return a[i]; }
void update(long long val) {
REP(i, 3) REP(j, 3) a[i][j] += (i != 2) * (i == 0 ? val : -val) + (j != 2) * (j == 0 ? val : -val);
}
long long get_ans() {
return a[2][2];
}
};
int get_code(int i) {
return i == 2 ? 2 : 1 ^ i;
}
node operator + (const node &lhs, const node &rhs) {
node ans;
REP(i, 3) REP(j, 3) {
REP(k, 3) {
maximize(ans[i][j], lhs[i][k] + rhs[get_code(k)][j]);
}
maximize(ans[i][j], max(lhs[i][j], rhs[i][j]));
}
return ans;
}
ostream & operator << (ostream &out, const node &res) {
REP(i, 3) REP(j, 3) out << res[i][j] << " \n"[j == 2];
return out;
}
node it[4 * MAX];
long long lazy[4 * MAX];
int n, q, a[MAX];
void build(int idx, int l, int r) {
if(l == r) it[idx] = node(a[l]);
else {
int mid = l + r >> 1;
build(idx << 1, l, mid);
build(idx << 1 | 1, mid + 1, r);
it[idx] = it[idx << 1] + it[idx << 1 | 1];
}
}
void push(int idx) {
if(lazy[idx] == 0) return;
it[idx << 1].update(lazy[idx]);
it[idx << 1 | 1].update(lazy[idx]);
lazy[idx << 1] += lazy[idx], lazy[idx << 1 | 1] += lazy[idx];
lazy[idx] = 0;
}
void update(int idx, int l, int r, int u, int v, int val) {
if(l > v || r < u) return;
if(l >= u && r <= v) {
it[idx].update(val);
lazy[idx] += val;
return;
}
push(idx);
int mid = l + r >> 1;
update(idx << 1, l, mid, u, v, val);
update(idx << 1 | 1, mid + 1, r, u, v, val);
it[idx] = it[idx << 1] + it[idx << 1 | 1];
}
void you_make_it(void) {
cin >> n >> q;
FOR(i, 1, n) cin >> a[i];
build(1, 1, n);
while(q--) {
int l, r, x; cin >> l >> r >> x;
update(1, 1, n, l, r, x);
cout << it[1].get_ans() << '\n';
}
}
signed main() {
#ifdef LOCAL
freopen("TASK.inp", "r", stdin);
freopen("TASK.out", "w", stdout);
#endif
file("sjeckanje");
auto start_time = chrono::steady_clock::now();
cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
you_make_it();
auto end_time = chrono::steady_clock::now();
cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;
return (0 ^ 0);
}
// Dream it. Wish it. Do it.
