#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m,k;
int a[200005],val[200005];

ll solve(){
//	rep(i,1,k) printf("%d ",a[i]);
//	printf("\n");
	if(k % 2 == 0){
		ll ans = 0;
		k /= 2;
		rep(i,1,k) ans -= a[i];
		rep(i,k + 1,2 * k) ans += a[i];
		ans *= 2;
		ans += a[k] - a[k + 1];
		return ans;
	}
	if(k == 1) return 0;
	k /= 2;
	ll ans = 0,sum = 0;
	rep(i,1,k) ans -= a[i];
	rep(i,k + 1,2 * k + 1) ans += a[i];
	ans *= 2;
	ans -= a[k + 1] + a[k + 2];

	sum = 0;
	rep(i,1,k + 1) sum -= a[i];
	rep(i,k + 2,2 * k + 1) sum += a[i];
	sum *= 2;
	sum += a[k + 1] + a[k];
//	printf("%lld %lld\n",ans,sum);
	return max(ans,sum);
}

int main(){
	scanf("%d%d",&n,&m);
	rep(i,1,n) scanf("%d",&val[i]);
	rep(i,1,m){
		int l,r;
		scanf("%d%d",&l,&r);
		k = 0;
		rep(j,l,r) a[++k] = val[j];
		sort(a + 1,a + k + 1);
		printf("%lld\n",solve());
	}
	return 0;
}