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

template<typename T>
struct BIT {
    int n;
    vector<T> dat;

    BIT(int n=0){
        initialize(n);
    }

    void initialize(int nin){
        n = nin;
        dat.resize(n, 0);
    }

    T sum(int i){
        T s = 0;
        while(i >= 0){
            s += dat[i];
            i = (i & (i+1)) - 1;
        }
        return s;
    }

    T sum_between(int i, int j){
        return sum(j) - sum(i-1);
    }

    void plus(int i, T x){
        while(i < n){
            dat[i] += x;
            i |= i+1;
        }
    }

    // a[0]+...+a[ret] >= x
    int lower_bound(T x){
        int ret = -1;
        int k = 1;
        while(2*k <= n) k <<= 1;
        for( ;k>0; k>>=1){
            if(ret+k < n && dat[ret+k] < x){
                x -= dat[ret+k];
                ret += k;
            }
        }
        return ret + 1;
    }
};

int main(){
    int N, Q;
    cin >> N >> Q;
    vector<int> A(N);
    set<int> st;
    for(int i=0; i<N; i++){
        cin >> A[i];
        st.insert(A[i]);
    }
    vector<int> cmp;
    for(auto a : st) cmp.push_back(a);
    int sz = cmp.size();
    vector<int> Ai(N);
    for(int i=0; i<N; i++) Ai[i] = lower_bound(cmp.begin(), cmp.end(), A[i]) - cmp.begin();

    const int B = 450;
    vector<vector<int>> q_rli[B];
    for(int i=0; i<Q; i++){
        int l, r;
        cin >> l >> r;
        l--; r--;
        q_rli[l/B].push_back({r, l, i});
    }

    BIT<int> bit_num(sz);
    BIT<int64_t> bit_sum(sz);
    int L = 0, R = -1;
    auto add = [&](int i, int d){
        bit_num.plus(Ai[i], d);
        bit_sum.plus(Ai[i], d*A[i]);
    };
    auto adjust = [&](int L2, int R2){
        while(L2 < L) L--, add(L, 1);
        while(R < R2) R++, add(R, 1);
        while(L < L2) add(L, -1), L++;
        while(R2 < R) add(R, -1), R--;
    };

    vector<int64_t> ans(Q);
    for(int b=0; b<B; b++){
        auto& qs = q_rli[b];
        sort(qs.begin(), qs.end());
        for(auto& q : qs){
            int r = q[0], l = q[1], i = q[2];
            adjust(l, r);
            int mi = bit_num.lower_bound((r-l+2)/2);
            int num1 = bit_num.sum_between(0, mi);
            int num2 = r-l+1 - num1;
            int64_t med = cmp[mi];
            ans[i] += num1 * med - bit_sum.sum_between(0, mi);
            ans[i] += bit_sum.sum_between(mi+1, sz-1) - num2 * med;
        }
    }
    for(int64_t a : ans) cout << a << endl;
    return 0;
}