#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,q;
int A[202020];
int L[202020],R[202020];
const int DI=500;
vector<pair<int,int>> ev[500];
ll ret[202020];

multiset<int> P,Q;
ll AP=0,AQ=0;

void add(int v) {
	P.insert(v);
	AP+=v;
	v=*P.rbegin();
	AP-=v;
	P.erase(P.find(v));
	Q.insert(v);
	AQ+=v;
	if(P.size()<Q.size()) {
		v=*Q.begin();
		AQ-=v;
		AP+=v;
		P.insert(v);
		Q.erase(Q.begin());
	}
}
void del(int v) {
	if(P.count(v)) {
		P.erase(P.find(v));
		AP-=v;
		if(P.size()<Q.size()) {
			v=*Q.begin();
			AQ-=v;
			AP+=v;
			P.insert(v);
			Q.erase(Q.begin());
		}
	}
	else if(Q.count(v)) {
		Q.erase(Q.find(v));
		AQ-=v;
		if(Q.size()+2<=P.size()) {
			v=*P.rbegin();
			AP-=v;
			P.erase(P.find(v));
			Q.insert(v);
			AQ+=v;
		}
		
	}
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>q;
	FOR(i,N) cin>>A[i];
	FOR(i,q) {
		cin>>L[i]>>R[i];
		L[i]--;
		ev[L[i]/DI].push_back({R[i],i});
	}
	FOR(i,500) {
		sort(ALL(ev[i]));
		P.clear();
		Q.clear();
		AP=AQ=0;
		int SL=i*DI,SR=i*DI;
		FORR(e,ev[i]) {
			x=e.second;
			while(L[x]<SL) add(A[--SL]);
			while(SR<R[x]) add(A[SR++]);
			while(SL<L[x]) del(A[SL++]);
			while(R[x]<SR) add(A[--SR]);
			y=*P.rbegin();
			ret[x]=(AQ-1LL*y*Q.size())+(1LL*y*P.size()-AP);
		}
		
	}
	FOR(i,q) cout<<ret[i]<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}