#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	int x, q;
	cin >> x >> q;
	std::vector<pair<ll, int>> v(x);
	for (int i = 0; i < x; i++) {
		ll x;
		cin >> x;
		v[i] = make_pair(x, i);
	}
	sort(v.begin(), v.end());
	while (q--) {
		int a, b, c;
		cin >> a >> b >> c;
		a--;
		b--;
		/*priority_queue<ll, vector<ll>, greater<ll>> pq;
		for (int i = (a-1); i < b; i++) pq.push(v[i]);
		ll ans = 0ll;
		while (c--) {
			ans += pq.top();
			pq.pop();
		}
		cout << ans << endl;*/
		ll ans = 0ll, count = 0ll, counnt = 0ll;
		while (counnt < c) {
			if ((v[count].second >= a) && (v[count].second <= b)) {
			  ans += v[count].first;
			  counnt++;
			}
			count++;
		}
		cout << ans << endl;
  }
	return 0;
}