#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, q, a, b, c;
cin>>n>>q;
vector<int> vect(n+1, 0);
for (int i=1; i<=n; ++i)cin>>vect[i];
while (q--){
cin>>a>>b>>c;
for (int i=a; i<=b; ++i)vect[i]+=c;
vector<int> dp(n+1, 0);
int pos=vect[1], neg=-vect[1];
for (int i=2; i<=n; ++i){
dp[i]=max(pos-vect[i], vect[i]+neg);
pos=max(pos, dp[i-1]+vect[i]);
neg=max(neg, dp[i-1]-vect[i]);
}
cout<<dp[n]<<"\n";
}
}
