#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb emplace_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif
using namespace std;
const int N = 1e6+5;
const int M = 2005;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;
int a[N];
int dp[N];
signed main() {
INIT
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
///////////
int n, q;
cin >> n >> q;
forn(i,n) cin >> a[i];
while(q--) {
forn(i,n) dp[i] = 0;
int x, y, c;
cin >> x >> y >> c;
FOR(i,x-1,y-1) a[i] += c;
forn1(i,n-1) {
int mx = a[i], mn = a[i];
for(int j = i-1; j >= 0; j--) {
chmax(mx, a[j+1]);
chmin(mn, a[j+1]);
chmax(dp[i], dp[j]+mx-mn);
}
chmax(mx, a[0]);
chmin(mn, a[0]);
chmax(dp[i], mx-mn);
}
cout << dp[n-1] << endl;
}
}
