#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define ll long long
using namespace std;
int n,m;
int a[200005];
int l,r;
int len,c[200005];
struct node{
	int l,r,c;
	ll s;
};
ll work(){
	ll ans=0;
	sort(c+1,c+1+len);
	if (len&1){
		int mid=(len+1)/2;
		for (int i=1;i<=len;i++)ans+=2ll*c[i];
		for (int i=1;i<mid;i++)ans-=4ll*c[i];
		ans-=min(0ll+c[mid]+c[mid+1],3ll*c[mid]-c[mid-1]);
	}
	else{
		int mid=len/2;
		for (int i=1;i<=len;i++)ans+=2ll*c[i];
		for (int i=1;i<=mid;i++)ans-=4ll*c[i];
		ans-=c[mid+1];
		ans+=c[mid];
	}
	return ans;
}
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)scanf("%d",&a[i]);
	while(m--){
		scanf("%d%d",&l,&r);
		len=0;
		for (int i=l;i<=r;i++)c[++len]=a[i];
		sort(c+1,c+1+len);
		ll ans=0;
		ans+=work();
		printf("%lld\n",ans);
	}
	return 0;
}