#include<cstdio>
#include<algorithm>
#define rep(a,b,c) for(int c=(a);c<=(b);++c)
inline int read()
{
	int res=0;char ch=getchar();while(ch<'0'||ch>'9')ch=getchar();
	while(ch<='9'&&ch>='0')res=res*10+(ch^48),ch=getchar();return res;
}
const int BK=333,N=1e5+10,QN=5e5+10;int loc[N],a[N],w[N],n,Q,lc[N],rc[N],stk[N],blk,B[N],top;long long Ans,ans[QN];
struct Query{int l,r,idx;inline bool operator<(const Query &Q)const{return loc[l]==loc[Q.l]?r>Q.r:l<Q.l;};}t[QN];
inline int Abs(const int &x){return x<0?-x:x;}
inline void del(const int &x)
{
//	if(!lc[x]&&!rc[x])return;
	if(!lc[x]){Ans-=Abs(w[rc[x]]-w[x]);lc[rc[x]]=0;stk[++top]=x;return;}
	if(!rc[x]){Ans-=Abs(w[lc[x]]-w[x]);rc[lc[x]]=0;stk[++top]=x;return;}
	Ans+=Abs(w[lc[x]]-w[rc[x]])-Abs(w[lc[x]]-w[x])-Abs(w[rc[x]]-w[x]);
	rc[lc[x]]=rc[x];lc[rc[x]]=lc[x];stk[++top]=x;
}
inline void Del(const int &x)
{
//	if(!lc[x]&&!rc[x]){return;}
	if(!lc[x]){Ans-=Abs(w[rc[x]]-w[x]);lc[rc[x]]=0;stk[++top]=x;return;}
	if(!rc[x]){Ans-=Abs(w[lc[x]]-w[x]);rc[lc[x]]=0;stk[++top]=x;return;}
	Ans+=Abs(w[lc[x]]-w[rc[x]])-Abs(w[lc[x]]-w[x])-Abs(w[rc[x]]-w[x]);
	rc[lc[x]]=rc[x];lc[rc[x]]=lc[x];
}
inline void ins(const int &x)
{
//	if(!lc[x]&&!rc[x])return;
	if(!lc[x]){Ans+=Abs(w[x]-w[rc[x]]);lc[rc[x]]=x;return;}
	if(!rc[x]){Ans+=Abs(w[x]-w[lc[x]]);rc[lc[x]]=x;return;}
	Ans-=Abs(w[lc[x]]-w[rc[x]])-Abs(w[lc[x]]-w[x])-Abs(w[rc[x]]-w[x]);
	rc[lc[x]]=lc[rc[x]]=x;return;
}
inline void BackTo(const int &x){while(top>x){ins(stk[top--]);}}
inline void Init(){rep(1,n,i){loc[i]=(i-1)/BK+1;if(loc[i]!=loc[i-1])B[++blk]=i;}}
int main()
{
	n=read();Q=read();rep(1,n,i)w[a[i]=read()]=i;Init();
	rep(1,Q,i)t[i].l=read(),t[i].r=read(),t[i].idx=i;std::sort(t+1,t+Q+1);
	for(int i=1;i<n;++i)lc[i]=i-1,rc[i]=i+1,Ans+=Abs(w[i]-w[i+1]);lc[n]=n-1;
//	rep(1,Q,i)printf("%d :: [%d,%d]\n",i,t[i].l,t[i].r);
	int b=1,R=n;rep(1,Q,i)
	{
		if(loc[t[i].l]!=loc[t[i-1].l]){BackTo(0);for(int j=B[b];j<B[b+1];++j)Del(j);++b;R=n;}
		while(R>t[i].r)del(a[R--]);int tmp=top;for(int j=B[b];j<t[i].l;++j)del(a[j]);ans[t[i].idx]=Ans;BackTo(tmp);
//		printf("%d :: ",i);rep(1,n,i)printf("(%d,%d) ",lc[i],rc[i]);putchar('\n');
	}
	rep(1,Q,i)printf("%lld\n",ans[i]);return 0;
}