#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
for (; l != r; ++l)
cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif
int main () {
owo;
int n, q;
cin >> n >> q;
vector <int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector <int> mx(n);
int t, l, r;
cin >> t >> l >> r, q--, --l;
deque <int> dq;
for (int i = 0; i < n; ++i) {
if (!dq.empty() && i - dq.front() == t + 1)
dq.pop_front();
while (!dq.empty() && a[dq.back()] <= a[i])
dq.pop_back();
dq.push_back(i);
mx[i] = a[dq.front()];
}
vector <lli> pre(n + 1);
for (int i = 0; i < n; ++i)
pre[i + 1] = pre[i] + mx[i];
cout << pre[r] - pre[l] << '\n';
while (q--) {
cin >> t >> l >> r, --l;
cout << pre[r] - pre[l] << '\n';
}
}
