#include<bits/stdc++.h>
using namespace std;
int n,q,a[100005];
int bel[100005],bell[100005],belr[100005],p[100005],cnt,B;
typedef long long ll;
int lst[100005],nxt[100005],tl[100005],tr[100005];
ll ans[100005],sum;
int pp[100005],idx;
struct query{
	int l,r,id;
	bool operator <(const query &b) const
	{
		return bel[l]!=bel[b.l]?bel[l]<bel[b.l]:r>b.r;
	}
}qu[500005];
int aabs(int x)
{
	return x>0?x:-x;
}
struct node{
	int x,y,mid;
	ll dt;
}sta[100005];
int top;
void del(int x,int op)
{
	ll dt=0;
	int llst=lst[x],rrst=nxt[x];
	if(llst&&rrst) dt+=aabs(p[rrst]-p[llst]);
	if(llst) dt-=aabs(p[x]-p[llst]),lst[rrst]=llst;
	if(rrst) dt-=aabs(p[x]-p[rrst]),nxt[llst]=rrst;
	if(op) sta[++top]={llst,rrst,x,dt};
	sum+=dt;
}
ll solve(int l,int r)
{
	ll sum=0,lst=0;
	for(int i=1;i<=idx;i++)
	{
		if(l<=pp[i]&&pp[i]<=r)
		{
			if(lst) sum+=aabs(pp[i]-lst);
			lst=pp[i];
		}
	}
	return sum;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>q;
	B=n/sqrt(q);
	if(B==0) B++;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		p[a[i]]=i;
		bel[i]=(i+B-1)/B;
		if(bel[i]!=cnt) cnt++,bell[cnt]=i;
		belr[cnt]=i;
	}
	for(int i=1;i<=q;i++)
	{
		cin>>qu[i].l>>qu[i].r;
		qu[i].id=i;
	}
	sort(qu+1,qu+1+q);
	iota(lst+1,lst+1+n,0);
	iota(nxt+1,nxt+1+n,2);
	for(int i=2;i<=n;i++)
	{
		sum+=aabs(p[i]-p[i-1]);
	}
	nxt[n]=0;
	for(int i=1,j=1;i<=cnt;i++)
	{
		memcpy(tl,lst,sizeof(tl));
		memcpy(tr,nxt,sizeof(nxt));
		ll summ=sum;
		int L=bell[i],R=belr[i];
		idx=0;
		for(int i=L;i<=R;i++)
		{
			pp[++idx]=i;
		}
		sort(pp+1,pp+1+idx,[&](int x,int y){
			return a[x]<a[y];
		});
		int l=bell[i],r=n;
		for(;bel[qu[j].l]==i;j++)
		{
			if(bel[qu[j].r]==i) ans[qu[j].id]=solve(qu[j].l,qu[j].r);
			while(r>qu[j].r) del(a[r--],0);
			while(l<qu[j].l) del(a[l++],1);
			ans[qu[j].id]=sum;
			while(top)
			{
				auto [x,y,mid,dt]=sta[top];
				top--;
				if(x) nxt[x]=mid;
				if(y) lst[y]=mid;
				sum-=dt;
			}
			l=bell[i];
		}
		sum=summ;
		memcpy(lst,tl,sizeof(tl));
		memcpy(nxt,tr,sizeof(nxt));
		for(int k=bell[i];k<=belr[i];k++) del(a[k],0);
	}
	for(int i=1;i<=q;i++)
	{
		cout<<ans[i]<<"\n";
	}
}