#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5e5+5;
int nex[N],las[N],rk[N],a[N],n,m,id[N],staans,stalas[N],stanex[N];
struct que{int l,r,id;}q[N];
ll now;
int solve(int x,int y,int z){return abs(x-z)-abs(y-z)-abs(x-y);}
void del(int x){
	if(las[x]==0) now-=abs(rk[nex[x]]-rk[x]);
	else if(nex[x]==n+1) now-=abs(rk[las[x]]-rk[x]);
	else now+=solve(rk[las[x]],rk[x],rk[nex[x]]);
	nex[las[x]]=nex[x];
	las[nex[x]]=las[x];
}
ll work(int l,int r){
	ll ans=0;
	for(int i=l;i<=r;i++){
		if(las[a[i]]==0) now-=abs(rk[nex[a[i]]]-rk[a[i]]);
		else if(nex[a[i]]==n+1) now-=abs(rk[las[a[i]]]-rk[a[i]]);
		else now+=solve(rk[las[a[i]]],rk[a[i]],rk[nex[a[i]]]);
		nex[las[a[i]]]=nex[a[i]];
		las[nex[a[i]]]=las[a[i]];
	}
	for(int i=r;i>=l;i--){
		nex[las[a[i]]]=a[i];
		las[nex[a[i]]]=a[i];
	}
	return ans+now;
}
ll ans[N];
int l[N];
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]),rk[a[i]]=i;
	int S=sqrt(n);
	for(int i=1;i<=n;i++)id[i]=(i-1)/S+1,l[id[i]+1]=i+1;
	l[1]=1;
	for(int i=1;i<=m;i++)scanf("%d%d",&q[i].l,&q[i].r),q[i].id=i;
	sort(q+1,q+m+1,[](que a,que b){return id[a.l]==id[b.l]?a.l<b.l:a.r>b.r;});
	for(int i=1;i<=n;i++)stalas[i]=i-1,stanex[i]=i+1;
	for(int i=1;i<n;i++)staans+=abs(rk[i+1]-rk[i]);
	int x=1;
	for(int Id=1;Id<=id[n];Id++){
		now=staans;
		memcpy(las,stalas,sizeof(las));
		memcpy(nex,stanex,sizeof(nex));
		for(int j=1;j<l[Id];j++)del(a[j]);
		int R=n;
		for(;id[q[x].l]==Id;x++){
			while(R>q[x].r)del(a[R--]);
			ans[q[x].id]=work(l[Id],q[x].l-1);
		}
	}
	for(int i=1;i<=m;i++)printf("%lld\n",ans[i]);
}