#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i)
#define RFOR(i, x, n) for (ll i =x; i>=n; --i)
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll const INF = -1e18;
ll a[100005];
struct seg
{
ll dp[3][3];
// 0 - min
// 1 - non
// 2 - max
seg(ll x = 0)
{
for (ll i=0; i<3; ++i) for (ll j=0; j<3; ++j) dp[i][j] = -INF;
dp[1][1] = 0;
dp[0][1] = dp[1][0] = -x;
dp[1][2] = dp[2][1] = x;
}
void add(ll x)
{
for (ll i=0; i<3; ++i)
{
dp[0][i] -= x;
dp[i][0] -= x;
dp[2][i] += x;
dp[i][2] += x;
}
}
seg operator + (const seg & other)
{
seg ans;
for (ll i=0; i<3; ++i) for (ll j=0; j<3; ++j) ans.dp[i][j] = max(dp[i][j], other.dp[i][j]);
for (ll i=0; i<3; ++i) for (ll j=0; j<3; ++j) for (ll i2=0; i2<3; ++i2) for (ll j2=0; j2<3; ++j2) if (j + i2 == 2) ans.dp[i][j2] = max(ans.dp[i][j2], dp[i][j] + other.dp[i2][j2]);
return ans;
}
void display()
{
//show3(dp, mn, mx);
//show2(mnl, mxl);
//show2(mnr, mxr);
}
};
struct node{
int s, e, m;
seg val;
ll lazy;
node *l, *r;
node (int S, int E)
{
s = S, e = E, m = (s+e)/2;
lazy = 0;
if (s==e) val = seg(a[s]);
else
{
l = new node(s, m);
r = new node(m + 1, e);
val = l->val + r->val;
}
//show2(s, e);
//val.display();
}
void propogate()
{
if (lazy==0) return;
val.add(lazy);
if (s != e){
l->lazy+=lazy;
r->lazy+=lazy;
}
lazy=0;
}
void update(int S, int E, ll V)
{
propogate();
if(s==S && e==E) lazy += V;
else{
if(E <= m) l->update(S, E, V);
else if (m < S) r->update(S, E, V);
else l->update(S, m, V),r->update(m+1, E, V);
l->propogate(),r->propogate();
val = l->val + r->val;
}
}
ll query()
{
return val.dp[1][1];
}
} *root;
int main()
{
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
ll n,q;
cin >> n >> q;
for (ll i=0; i<n; ++i) cin >> a[i];
root = new node(0, n-1);
//cout << root->query() << endl;
for (ll i=0; i<q; ++i)
{
ll l, r, x;
cin >> l >> r >> x;
root->update(l-1, r-1, x);
cout << root->query() << endl;
}
return 0;
}
