import sys
input = sys.stdin.readline

N,Q=list(map(int,input().split()))
A=list(map(int,input().split()))


def seg_function(x,y): # Segment treeで扱うfunction
    return sorted(x+y)

seg_el=1<<(N.bit_length()) # Segment treeの台の要素数
SEG=[[] for i in range(2*seg_el)]

for i in range(N): # Aを対応する箇所へupdate
    SEG[i+seg_el]=[A[i]]

for i in range(seg_el-1,0,-1): # 親の部分もupdate
    SEG[i]=seg_function(SEG[i*2],SEG[i*2+1])

def getvalues(l,r,k): # 区間[l,r)に関するseg_functionを調べる
    L=l+seg_el
    R=r+seg_el
    ANS=[]

    while L<R:
        if L & 1:
            ANS.append(SEG[L])
            L+=1

        if R & 1:
            R-=1
            ANS.append(SEG[R])
        L>>=1
        R>>=1

    score=0
    IND=[0]*len(ANS)

    while k:
        ind=0
        MIN=1<<60

        for i in range(len(ANS)):
            if IND[i]<len(ANS[i]) and ANS[i][IND[i]]<MIN:
                MIN=ANS[i][IND[i]]
                ind=i

        score+=MIN
        IND[ind]+=1
        k-=1

    return score

for tests in range(Q):
    l,r,k=list(map(int,input().split()))

    ANS=getvalues(l-1,r,k)

    print(ANS)