Given an array A having N integers in the range [-1e8, 1e8] and Q queries each having 3 integers [L, R, K]. For each query, the task is to return the sum of K smallest elements in the subarray A[L...R] where K = [1, R-L+1]. Thanks in advance :)