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

#define int long long
#define maxn 200005
int n, q;
int a[maxn], sum[maxn];

signed main() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + 1 + n); reverse(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
    //for (int i = 1; i <= n; i++) cout << a[i] << " " << sum[i] << endl;
    while (q--) {
        int x, y;
        cin >> x >> y;
        cout << sum[x] - sum[y - 1] << endl;
    }
    return 0;
}

第二个点就挂了