#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first 
#define S second
const int N = 2005, Q = 2e5 + 5;
const int inf = 1e18;

int arr[N];
int ans[Q];
struct Point{
    int l, r, val;
    int qid;
};
vector<Point> a;
Point tmp[4000005];
bool cmp(Point &x, Point &y){
    if(x.l != y.l){
        return x.l > y.l;
    }
    return x.qid < y.qid;
}
int n;

// int node[N << 2];
// vector<int> valstk[N];
// void build(int v = 1, int ll = 1, int rr = n){
//     node[v] = -inf;
//     if(ll == rr){
//         return;
//     }
//     int mid = ll + rr >> 1;
//     build(v << 1, ll, mid);
//     build(v << 1 | 1, mid + 1, rr);
// }

// void modify(int p, int val, int v = 1, int ll = 1, int rr = n){
//     if(ll == rr){
//         node[v] = val;
//         return;
//     }
//     int mid = ll + rr >> 1;
//     if(p <= mid){
//         modify(p, val, v << 1, ll, mid);
//     }else{
//         modify(p, val, v << 1 | 1, mid + 1, rr);
//     }
//     node[v] = max(node[v << 1], node[v << 1 | 1]);
// }

// int query_max(int ql, int qr, int v = 1, int ll = 1, int rr = n){
//     if(ql == ll && qr == rr){
//         return node[v];
//     }
//     int mid = ll + rr >> 1;
//     if(qr <= mid){
//         return query_max(ql, qr, v << 1, ll, mid);
//     }else if(ql > mid){
//         return query_max(ql, qr, v << 1 | 1, mid + 1, rr);
//     }else{
//         return max(query_max(ql, mid, v << 1, ll ,mid), query_max(mid + 1, qr, v << 1 | 1, mid + 1, rr));
//     }
// }

int bit[N];

int lowbit(int x){
    return x & (-x);
}

void modify(int x, int val, vector<pair<int, int> > &save){
    while(x <= n){
        save.push_back({x, bit[x]});
        bit[x] = max(bit[x], val);
        x += lowbit(x);
    }
}

int query(int x){
    int maxn = -inf;
    while(x > 0){
        maxn = max(maxn, bit[x]);
        x -= lowbit(x);
    }
    return maxn;
}

void divi(int ll, int rr){
    if(ll == rr){
        return;
    }
    int mid = ll + rr >> 1;
    divi(ll, mid);
    divi(mid + 1, rr);
    int ptr = ll;
    int tmpid = 0;
    vector<pair<int, int> > undo;
    for(int i = mid + 1; i <= rr; i++){
        while(ptr <= mid && a[ptr].val <= a[i].val){
            if(a[ptr].qid == 0){
                // valstk[a[ptr].r].push_back(a[ptr].val);
                // modify(a[ptr].r, a[ptr].val);      
                modify(a[ptr].r, a[ptr].val, undo);

            }
            tmp[tmpid] = a[ptr];
            tmpid++;
            ptr++;
        }
        if(a[i].qid != 0){
            ans[a[i].qid] = max(ans[a[i].qid], query(a[i].r));
        }
        tmp[tmpid] = a[i];
        tmpid++;
    }
    for(int i = (int)undo.size() - 1; i >= 0; i--){
        bit[undo[i].first] = undo[i].second;
    }

    while(ptr <= mid){
        tmp[tmpid] = a[ptr];
        tmpid++;
        ptr++;
    }
    for(int i = ll; i <= rr; i++){
        a[i] = tmp[i - ll];
    }
}

void solve(){
    int q;
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
        cin >> arr[i];
        // valstk[i].push_back(-inf);
        bit[i] = -inf;
    }
    int sum;
    // build();
    for(int i = 1; i <= n; i++){
        sum = 0;
        for(int j = i; j <= n; j++){
            sum += arr[j];
            a.push_back({i, j, sum, 0});
        }
    }
    int l, r, u;
    for(int i = 1; i <= q; i++){
        cin >> l >> r >> u;
        ans[i] = -inf;
        a.push_back({l, r, u, i});
    }
    sort(a.begin(), a.end(), cmp);
    divi(0, (int)a.size() - 1);
    for(int i = 1; i <= q; i++){
        if(ans[i] == -inf){
            cout << "NONE\n";
        }else{
            cout << ans[i] << '\n';
        }
    }
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0); 
    solve();
}