#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int mod = 1e9 + 7, inf = 1e17;
struct node { int first, last, xx, xy, yx, yy, ans; };
node merge(node left, node right) {
node res;
res.first = left.first, res.last = right.last, res.xx = max({left.xx + right.xx + max(0ll, left.last - right.first), left.xy + right.xx, left.xx + right.yx, left.xy + right.yx + max(0ll, right.first - left.last)}), res.xy = max({left.xx + right.xy + max(0ll, left.last - right.first), left.xy + right.xy, left.xx + right.yy, left.xy + right.yy + max(0ll, right.first - left.last)}), res.yx = max({left.yx + right.xx + max(0ll, left.last - right.first), left.yy + right.xx, left.yx + right.yx, left.yy + right.yx + max(0ll, right.first - left.last)}), res.yy = max({left.yx + right.xy + max(0ll, left.last - right.first), left.yy + right.xy, left.yx + right.yy, left.yy + right.yy + max(0ll, right.first - left.last)}), res.ans = max({res.xx, res.xy, res.yx, res.yy});
return res;
}
struct segment_tree {
int n;
vector<node> t;
vector<int> lz;
void build(vector<int> &a, int v = 1, int l = 0, int r = -1) {
if (r < 0) r += n;
if (l == r) t[v] = {a[l], a[l], 0, -inf, -inf, 0, 0};
else {
int m = (l + r) >> 1;
build(a, v << 1, l, m);
build(a, v << 1 | 1, m + 1, r);
t[v] = merge(t[v << 1], t[v << 1 | 1]);
}
}
segment_tree(vector<int> &a) : n(a.size()), t(n << 2), lz(n << 2) { build(a); }
void push(int v, int l, int r) {
t[v].first += lz[v], t[v].last += lz[v];
if (l < r) lz[v << 1] += lz[v], lz[v << 1 | 1] += lz[v];
lz[v] = 0;
}
void update(int L, int R, int x, int v = 1, int l = 0, int r = -1) {
if (r < 0) r += n;
push(v, l, r);
if (L <= l && r <= R) lz[v] += x, push(v, l, r);
else {
int m = (l + r) >> 1;
if (L <= m) update(L, R, x, v << 1, l, m);
else push(v << 1, l, m);
if (R > m) update(L, R, x, v << 1 | 1, m + 1, r);
else push(v << 1 | 1, m + 1, r);
t[v] = merge(t[v << 1], t[v << 1 | 1]);
}
}
int get() { return t[1].ans; }
};
int32_t main() {
#ifdef JahonaliX
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, q;
cin >> n >> q;
vector<int> a(n);
for (int &i : a) cin >> i;
segment_tree s(a);
while (q--) {
int l, r, x;
cin >> l >> r >> x, l--, r--, s.update(l, r, x), cout << s.get() << '\n';
}
return 0;
}
