#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
int f(vector<int> &a){
int n = a.size();
vector<int> dp(n);
dp[0] = 0;
int minus = -a[0], plus = a[0];
for(int i = 1;i < n; i++){
minus = max(dp[i-1] - a[i], minus);
plus = max(dp[i-1] + a[i], plus);
dp[i] = max({dp[i-1], plus - a[i], minus + a[i]});
}
return *max_element(all(dp));
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, q; cin >> n >> q;
vector<int> a(n);
for(auto &e : a) cin >> e;
while(q--){
int l, r, x; cin >> l >> r >> x;
l--, r--;
vector<int> v;
for(int i = 0;i < n; i++){
if(l <= i && r >= i) a[i]+= x;
if(v.size() >= 2 && a[i] == v[v.size()-1] && a[i] == v[v.size()-2]){
continue;
}
v.push_back(a[i]);
}
cout << f(v) << '\n';
}
return 0;
}
