#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
if (a < b) {a = b; return true;} return false;
}
int n;
int q;
ll a[mxN];
ll dp[mxN][2];
void solve()
{
cin >> n >> q;
for(int i = 1; i <= n; i++) cin >> a[i];
while(q--) {
int l, r, x;
cin >> l >> r >> x;
for(int i = l; i <= r; i++) a[i] += x;
for(int i = 1; i <= n; i++)
for(int j = 0; j < 2; j++) dp[i][j] = -infll;
dp[1][0] = dp[1][1] = 0;
for(int i = 1; i < n; i++) {
for(int j = 0; j < 2; j++) {
if(dp[i][j] == -infll) continue;
if(j == 0) {
if(a[i] < a[i + 1]) maximize(dp[i + 1][0], dp[i][j] + a[i + 1] - a[i]);
}
if(j == 1) {
if(a[i] > a[i + 1]) maximize(dp[i + 1][1], dp[i][j] + a[i] - a[i + 1]);
}
maximize(dp[i + 1][0], dp[i][j]);
maximize(dp[i + 1][1], dp[i][j]);
}
}
cout << max(dp[n][0], dp[n][1]) << endl;
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int tc = 1;
//cin >> tc;
while(tc--) {
solve();
}
return 0;
}
