#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }
vector<int> op(vector<int>l, vector<int>r) {
	vector<int>v;
	int li = 0, ri = 0;
	while (li < l.size() || ri < r.size()) {
		if (v.size() == 10) break;
		if (li == l.size()) {
			v.push_back(r[ri]);
			ri++;
			continue;
		}
		if (ri == r.size()) {
			v.push_back(l[li]);
			li++;
			continue;
		}
		if (l[li] > r[ri]) {
			v.push_back(r[ri]);
			ri++;
			continue;
		}
		else {
			v.push_back(l[li]);
			li++;
			continue;
		}
	}
	return v;
}
vector<int>e() {
	return {};
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<int>s(n);
	segtree<vector<int>, op, e>seg(n);
	rep(i, n) {
		int s; cin >> s;
		seg.set(i, { s });
	}
	while (q--) {
		int l, r, k; cin >> l >> r >> k;
		l--;
		auto v = seg.prod(l, r);
		long long ans = 0;
		rep(i, k)ans += v[i];
		cout << ans << endl;
	}
	return 0;
}