// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
// #define _GLIBCXX_DEBUG
// #define _GLIBCXX_DEBUG_PEDANTIC
#include <iomanip>
#include <cassert>
#include <iostream>
#include <vector>
#include <random>
#include <algorithm>
#include <map>
#include <set>
#include <functional>
#include <array>
#include <numeric>
#include <queue>
#include <deque>
#include <bitset>
#include <cmath>
#include <climits>
#include <cstdint>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/rope>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;
const int MOD = 998244353;
const long double PI = 3.141592653589793;
using ll = long long;
const ll INF = 1e18;
#define int ll
// --------> sashko123`s defines:
#define itn int //Vasya sorry :(
#define p_b push_back
#define fi first
#define se second
#define pii std::pair<int, int>
#define oo LLONG_MAX
#define big INT_MAX
#define elif else if
int input()
{
int x;
cin >> x;
return x;
}
// ----------> end of sashko123`s defines (thank you Vasya <3)
// template<typename K, typename V>
// using hash_table = cc_hash_table<K, V, hash<K>>;
// template<typename T>
// using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
int sig(int a) {
if (a < 0)
return -1;
if (a == 0)
return 0;
return 1;
}
void solve() {
int n, q;
cin >> n >> q;
vector<int> a(n + 1);
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 + 1; i++)
a[i] += x;
ll ans = 0;
int last = 0;
int first = 0;
for (int i = 2; i + 1 <= n; i++) {
if (a[i - 1] < a[i] && a[i] >= a[i + 1]) {
ans += a[i] + max(a[i - 1], a[i + 1]);
last = 1;
if (first == 0)
first = 1;
}
if (a[i - 1] >= a[i] && a[i] < a[i + 1]) {
ans -= a[i] + min(a[i - 1], a[i + 1]);
last = -1;
if (first == 0)
first = -1;
}
}
if (a[1] > a[2])
ans += a[1];
else if (a[1] < a[2])
ans -= a[1];
if (a[1] == a[2]) {
ans += first * a[1];
}
if (a[n] > a[n - 1])
ans += a[n];
else if (a[n] < a[n - 1])
ans -= a[n];
if (a[n] == a[n - 1]) {
ans -= last * a[n];
}
cout << ans << "\n";
}
}
int32_t main(int32_t argc, const char * argv[]) {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
// insert code here...
int tt= 1;
// std::cin >> tt;
for (int t = 1; t <= tt; t++) {
// cout << "Case #" << t << ": ";
solve();
}
return 0;
}
