#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define mp make_pair
#define Sz(x) (int)x.size()
using namespace std;
const int N = 2e5 + 5;
int n, q, a[N], b[N];
vector <int> save[N];
void solve() {
cin >> n >> q;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
while (q--) {
int t, l, r;
cin >> t >> l >> r;
for (int i = 1; i <= n; i++) {
b[i] = a[i];
}
for (int i = 1; i <= t; i++) {
for (int j = n; j >= 2; j--) {
b[j] = max(b[j], b[j - 1]);
}
}
int sum = 0;
for (int i = l; i <= r; i++) {
sum += b[i];
}
cout << sum << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int tt = 1;
// cin >> tt;
while (tt--) {
solve();
// cout << '\n';
}
}
