呃呃呃，#7#8RE?

//
//  main.cpp
//  借教室
//
//  Created by 汪汪队 on 2023/9/30.
//

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstdint>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#define int long long
#define double long double
#define ve vector<int>
#define dq deque<int>
#define vep vector<pair<int,int>>
#define vepush emplace_back
#define map map<int,int>
#define umap unordered_map<int,int>
#define uset unordered_set<int,int>
#define show(p) for(auto t: p) cout<<t<<" "; cout<<endl;
#define endl "\n"
#define all(a) a.begin(), a.end()
#define inf 0x3f3f3f3f
#define INF 0xffffffff
#define mod 1000000007
#define MOD 998244353
#define lowbit(x) x&(-x)
#define WHILE_LOOP1
//#define WHILE_LOOP2
//#define FIND_WRONG
//#pragma GCC optimize ("O3")
//auto sum = [](auto x, auto y) { return x + y; };
using namespace std;

void solve();
bool bool_solve();
bool ansf=0;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int T; T=1;

    #ifdef WHILE_LOOP1
        while (T--) solve();
    #elif defined(WHILE_LOOP2)
        while (T--) {
            if (bool_solve())
                cout << "YES\n";
            else
                cout << "NO\n";
        }
    #endif

    return 0;
}
 
void solve(){
    int n,m; cin>>n>>m;
    ve p(n+1,0);
    for (int i=1; i<=n; i++) {
        cin>>p[i];
    }
    ve cf(n+2,0);
    for (int i=1; i<=n+1; i++) {
        cf[i]=p[i]-p[i-1];
    }
    struct Data{int d,x,y;};
    vector<Data>data;
    for (int i=1; i<=m; i++) {
        int _d,_x,_y; cin>>_d>>_x>>_y;
        data.push_back({_d,_x,_y});
    }
    auto check = [](int n,int mid,ve q,vector<Data>&data) {
        for (int i=1; i<=mid; i++) {
            q[data[i-1].x]-=data[i-1].d;
            q[data[i-1].y+1]+=data[i-1].d;
        }
        for (int i=1; i<=n; i++) {
            q[i]+=q[i-1];
            if(q[i]<0){ ansf=1; return 0;}
        }
        return 1;
    };
    int l=1; int r=n;
    while (l<r) {
        int mid=(l+r)/2;
        if(check(n,mid,cf,data)){
            l=mid+1;
        }
        else r=mid;
    }
    if(!check(n,l,cf,data)){
        cout<<-1<<endl<<l<<endl; return;
    }
    if(!ansf){
        cout<<0<<endl; return;
    }
    else{
        cout<<-1<<endl<<l<<endl; return;
    }
    return;
}

bool bool_solve(){
    
    return 1;
}