Problem: You are a car race organizer and would like to arrange some races in Linear Kingdom.

Linear Kingdom has n consecutive roads spanning from left to right. The roads are numbered from 1 to n from left to right, thus the roads follow in the order of their numbers' increasing. There will be several races that may be held on these roads. Each race will use a consecutive subset of these roads. Also, each race will pay some amount of money to you if this race is held. No races overlap in time, so some roads can be used in several races.

Unfortunately, some of the roads are in a bad condition and they need repair. Each road has repair costs associated with it, you are required to pay this cost to repair the road. A race can only take place if all the roads used in the race are renovated. Your task is to repair such roads (possibly all or none) that will maximize your profit. Your profit is defined as the total money you get from the races that are held minus the total money you spent to repair the roads. Note that you may decide not to repair any road and gain zero profit.

Print the maximum profit you can gain.

Input

The first line contains two single-space separated integers, n and m (1 ≤ n, m ≤ 2·105), denoting the number of roads and the number of races, respectively.

Then n lines follow, each line will contain a single non-negative integer not exceeding 109 denoting the cost to repair a road. The costs are given in order from road 1 to road n.

Finally, m lines follow. Each line is single-space-separated triplets of integers. Each triplet will be given as lb, ub, and p (1 ≤ lb ≤ ub ≤ n, 1 ≤ p ≤ 109), which means that the race these three integers describe will use all the roads from lb to ub, inclusive, and if it's held you get p.

Output

Print a single integer denoting the maximum possible profit you can gain.

Please, do not use the %lld specificator to read or write 64-bit integers in C++. It is recommended to use cin, cout stream (also you may use %I64d specificator).

Examples

Input

7 4
3
2
3
2
1
2
3
1 2 5
2 3 5
3 5 3
7 7 5


Output

4


Input

2 1
0
3
1 2 5


Output

2


Input

3 1
10
10
10
1 3 10


Output

0

Note

In the first sample the optimal solution is to repair roads 1, 2, 3, and 7. Three races will take place which nets you 15. The road repair costs 11, hence your profit is 4.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read() {
  T x = 0;
  char ch = getchar();
  bool fl = false;
  while (!isdigit(ch)) {
    if (ch == '-') fl = true;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return fl ? -x : x;
}
const int maxn = 2e5 + 10;
const long long INF = 0x3f3f3f3f3f3f3f3f;
long long n, m;
vector<pair<long long, long long> > a[maxn];
long long cost[maxn];
namespace Segment_tree {
struct node {
  long long l, r;
  long long mx, tag;
} t[maxn << 2];
void build(long long p, long long l, long long r) {
  t[p].l = l, t[p].r = r;
  if (l == r) return;
  build((p << 1), l, ((l + r) >> 1));
  build((p << 1 | 1), ((l + r) >> 1) + 1, r);
}
inline void pushup(long long p) {
  t[p].mx = max(t[(p << 1)].mx, t[(p << 1 | 1)].mx);
  return;
}
inline void pushdown(long long p) {
  if (!t[p].tag) return;
  t[(p << 1)].mx += t[p].tag;
  t[(p << 1 | 1)].mx += t[p].tag;
  t[(p << 1)].tag += t[p].tag;
  t[(p << 1 | 1)].tag += t[p].tag;
  t[p].tag = 0;
  return;
}
void update(long long p, long long x, long long y, long long val) {
  long long l = t[p].l, r = t[p].r;
  if (x <= l && r <= y) {
    t[p].mx += val;
    t[p].tag += val;
    return;
  }
  pushdown(p);
  if (x <= ((l + r) >> 1)) update((p << 1), x, y, val);
  if (y > ((l + r) >> 1)) update((p << 1 | 1), x, y, val);
  pushup(p);
}
long long query(long long p, long long x, long long y) {
  long long l = t[p].l, r = t[p].r;
  if (x <= l && r <= y) return t[p].mx;
  pushdown(p);
  long long res = -INF;
  if (x <= ((l + r) >> 1)) res = max(res, query((p << 1), x, y));
  if (y > ((l + r) >> 1)) res = max(res, query((p << 1 | 1), x, y));
  return res;
}
}  // namespace Segment_tree
using namespace Segment_tree;
long long f[maxn];
signed main() {
  n = read<long long>();
  m = read<long long>();
  for (long long i = 1; i <= n; i++) cost[i] = read<long long>();
  for (long long i = 1; i <= m; i++) {
    long long l = read<long long>(), r = read<long long>();
    long long w = read<long long>();
    a[r].push_back(make_pair(l, w));
  }
  build(1, 0, n);
  for (long long i = 1; i <= n; i++) {
    update(1, 0, i - 1, -cost[i]);
    for (long long j = 0; j < a[i].size(); j++) {
      update(1, 0, a[i][j].first - 1, a[i][j].second);
    }
    f[i] = max(f[i - 1], query(1, 0, i - 1));
    update(1, i, i, f[i]);
  }
  printf("%lld\n", f[n]);
  return 0;
}