#include <cassert>
#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)(n); i++)
constexpr int inf = 2e9;

#include <atcoder/all>
using namespace atcoder;
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/math/common_factor_rt.hpp>
namespace mp = boost::multiprecision;
*/
using ll = long long;

pair<int, int> op(pair<int, int> a, pair<int, int> b)
{
    return min(a,b);
}

pair<int, int> e()
{
    return {inf,inf};
}
int main()
{
    int N, Q;
    cin >> N >> Q;
    segtree<pair<int, int>, op, e> seg(N);
    rep(i,N)
    {
        int s;
        cin >> s;
        seg.set(i,{s,i});
    }
    while (Q--)
    {
        int l,r,k;
        cin >> l >> r >> k;
        l--;
        if (k == 1)
        cout << seg.prod(l,r).first << endl;
        else
        {
            ll ans = 0;
            vector<pair<int, int>> M(k - 1);
            for (int i = 0; i < N; i++)
            {
                auto [val,idx] = seg.prod(l,r);
                M[i] = {val,idx};
                seg.set(idx,{inf,idx});
                ans += val;
            }
            cout << ans + seg.prod(l,r).first << endl;
            for (int i = 0; i < N; i++)
            {
                seg.set(M[i].first,M[i]);
            }
        }
    }
}