#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wpedantic"
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(seed);
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename V>
using table = gp_hash_table<T, V>;
using i128 = __int128;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
const ll INF = 1e13;
const int inf = 1e9;
const int maxk = 140;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
const int P = 5167;
const int L = 26;
const ld EPS = 1e-7;
const int W = 3;
const int MBIT = 18;
const int maxn = 2e5 + 7;
const int B = 550;
template<typename T, typename V>
void fill(T &container, V value) {
for (auto &c : container)
c = value;
}
# define int ll
void solve() {
int n, q;
cin >> n >> q;
vector<int> s(n);
for (int i = 0; i < n; ++i) cin >> s[i];
while (q--) {
int k, l, r;
cin >> k >> l >> r;
l--;
r--;
int ans = 0;
for (int i = l; i <= r; ++i) {
int mx = 0;
for (int j = max(0ll, i - k); j <= i; ++j) mx = max(mx, s[j]);
ans += mx;
}
cout << ans << "\n";
}
}
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(9);
int t = 1;
//cin >> t;
while (t--) solve();
#ifdef LOCAL
cout << "\n\n\n=====================================================\nProgram worked for: ";
cout << (ld) clock() / CLOCKS_PER_SEC << "s";
#endif
//stress();
}
