#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;

template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

struct SegmentTree {
private:
    int n;
    std::vector<i64> node;
 
public:
    SegmentTree(int sz) {
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, 0);
    }
 
    void update(int x, i64 val) {
        x += (n - 1);
        node[x] += val;
        while(x > 0) {
            x = (x - 1) / 2;
            node[x] = node[2*x+1] + node[2*x+2];
        }
    }
 
    i64 get(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        if(r <= a || b <= l) return 0;
        if(a <= l && r <= b) return node[k];
 
        i64 vl = get(a, b, 2*k+1, l, (l+r)/2);
        i64 vr = get(a, b, 2*k+2, (l+r)/2, r);
        return vl + vr;
    }
};

int main() {
	// input
	int n, q; scanf("%d%d", &n, &q);
	assert(1 <= n and n <= 2e5);
	assert(1 <= q and q <= 2e5);

	std::vector<int> a(n);
	for(int i = 0; i < n; i++) {
		scanf("%d", &a[i]);

		assert(-1e9 <= a[i] and a[i] <= 1e9);
	}

	std::vector<int> L(q), R(q);
	for(int i = 0; i < q; i++) {
		scanf("%d%d", &L[i], &R[i]);

		assert(1 <= L[i] and L[i] <= n);
		assert(1 <= R[i] and R[i] <= n);
		assert(L[i] <= R[i]);

		L[i]--;
	}
	
	// solve
	std::vector<std::pair<int, int>> vec;
	for(int i = 0; i < n; i++) vec.push_back({a[i], i});
	sort(begin(vec), end(vec));
	
	std::vector<i64> center = [&]{
		using P = std::pair<int, int>;
		
		std::vector<int> Left(q, -1), Right(q, n);
		std::vector<std::pair<int, int>> query, nxt;
		for(int i = 0; i < q; i++) query.push_back({(Left[i] + Right[i]) >> 1, i});

		while(!query.empty()) {
			sort(begin(query), end(query));

			int cur = 0;
			SegmentTree seg(n);
			for(int i = 0; i < n; i++) {
				seg.update(vec[i].second, 1);

				while(cur < query.size() and query[cur].first <= i) {
					auto & p = query[cur++];
					int id = p.second, mid = p.first;
		
					int len = (R[id] - L[id] + 1) >> 1;
					int val = seg.get(L[id], R[id]);
					if(len <= val) Right[id] = mid;
					else Left[id] = mid;

					if(Left[id] + 1 != Right[id])
						nxt.push_back({(Left[id] + Right[id]) >> 1, id});
				}
			}
			
			query.swap(nxt);
			nxt.clear();
		}

		std::vector<i64> center(q);
		for(int i = 0; i < q; i++) center[i] = vec[Left[i] + 1].first;
		return center;
	}();
	
	std::vector<i64> ans = [&]{
		std::vector<i64> ans(q);
		for(int loop = 0; loop < 2; loop++) {
			SegmentTree seg(n), cnt(n);
			
			std::vector<std::pair<int, int>> query;
			for(int i = 0; i < q; i++) query.push_back({center[i], i});
			sort(begin(query), end(query));
			if(loop) reverse(begin(query), end(query));

			int cur = 0;
			for(int i = 0; i < n; i++) {
				seg.update(vec[i].second, vec[i].first);
				cnt.update(vec[i].second, 1);

				while(cur < query.size() and query[cur].first == vec[i].first) {
					auto & p = query[cur++];
					i64 id = p.second, val = p.first;
					
					i64 tmp = val * cnt.get(L[id], R[id]) - seg.get(L[id], R[id]);
					ans[id] += tmp * (loop ? -1 : 1);
				}
			}

			reverse(begin(vec), end(vec));
		}
		return ans;
	}();

	for(auto v: ans) printf("%lld\n", v);
	return 0;
}