#include <bits/stdc++.h>
using namespace std;
using ll=long long;

template<typename S,auto op,auto e>
struct segtree{
  private:
  int siz;
  vector<S> val;
  S prod(int l,int r,int a,int b,int u){
    if(l<=a&&b<=r)return val[u];
    if(b<=l||r<=a)return e();
    int m=(a+b)/2;
    return op(prod(l,r,a,m,2*u),prod(l,r,m,b,2*u+1));
  }
  public:
  segtree(vector<S> a){
    int n=a.size();siz=1;
    while(siz<n)siz*=2;
    val.resize(siz*2,e());
    for(int i=0;i<n;i++)val[i+siz]=a[i];
    for(int i=siz-1;i>=1;i--)val[i]=op(val[2*i],val[2*i+1]);
  }
  S prod(int l,int r){return prod(l,r,0,siz,1);}
};

using ar=array<ll,10>;
ar f={1<<30,1<<30,1<<30,1<<30,1<<30,1<<30,1<<30,1<<30,1<<30,1<<30};
ar op(ar a,ar b){
  ar c;int l=0,r=0;
  for(int i=0;i<10;i++){
    if(a[l]<b[r])c[i]=a[l],l++;
    else c[i]=b[r],r++;
  }
  return c;
}
ar e(){return f;}

int main(){
  int n,q;cin>>n>>q;
  vector<ar> s(n,f);
  for(int i=0;i<n;i++)cin>>s[i][0];
  segtree<ar,op,e> seg(s);
  while(q--){
    int l,r,k;cin>>l>>r>>k;
    l--;
    ar p=seg.prod(l,r);
    ll ans=0;
    for(int i=0;i<k;i++)ans+=p[i];
    cout<<ans<<endl;
  }
}