#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(int)l;i<(int)r;i++)
#define all(a) a.begin(),a.end()
using ll=long long;

int main(){
  int n,q,m=10;cin>>n>>q;
  vector<vector<ll>> a(n+1);//実装の都合上1-indexedで扱います
  for(int i=1;i<n+1;i++){
    ll s;cin>>s;
    a[i]=a[i-1];
    a[i].push_back(s);
    sort(all(a[i]));
    if(a[i].size()>m)a[i].pop_back();
  }
  while(q--){
    int l,r,k;cin>>l>>r>>k;
    ll ans=0;
    rep(i,0,k)ans+=a[r][i];
    cout<<ans<<endl;
  }
}