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

-1
2

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5
 6 const long long MAXN = 1200000 + 10;
 7 const long long MAXM = 1200000 + 10;
 8
 9 inline void read(long long &x)
10 {
11     x = 0;char ch = getchar(), c = ch;
12     while(ch < '0' || ch > '9')c = ch, ch = getchar();
13     while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0', ch = getchar();
14     if(c == '-')x = -x;
15 }
16
17 long long n,m,r[MAXN],d[MAXM],s[MAXM],t[MAXM],tmp[MAXN];
18
19 long long check(long long rank)
20 {
21     for(register long long i = 1;i <= rank;++ i)
22         tmp[s[i]] -= d[i], tmp[t[i] + 1] += d[i];
23     long long sum = 0;
24     for(register long long i = 1;i <= n;++ i)
25     {
26         sum += tmp[i];
27         if(sum < 0)
28         {
29             for(register long long i = 1;i <= rank;++ i)
30                 tmp[s[i]] += d[i], tmp[t[i] + 1] -= d[i];
31             return 0;
32         }
33     }
34     for(register long long i = 1;i <= rank;++ i)
35         tmp[s[i]] += d[i], tmp[t[i] + 1] -= d[i];
36     return 1;
37 }
38
39 int main()
40 {
41     read(n), read(m);
42     for(register long long i = 1;i <= n;++ i)
43         read(r[i]);
44     for(register long long i = 1;i <= n;++ i)
45         tmp[i] = r[i] - r[i - 1];
46     for(register long long i = 1;i <= m;++ i)
47         read(d[i]), read(s[i]), read(t[i]);
48     long long l = 1, r = m, mid, ans = 0;
49     while(l <= r)
50     {
51         mid = (l + r) >> 1;
52         if(!check(mid))ans = mid, r = mid - 1;
53         else l = mid + 1;
54     }
55     if(!ans) printf("0");
56     else printf("-1\n%d", ans);
57     return 0;
58 }