#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>

#define fi first
#define se second
#define max Max
#define min Min
#define abs Abs
#define lc (x<<1)
#define rc (x<<1|1)
#define pb(x) push_back(x)
#define lowbit(x) (x&(-x))
#define fan(x) (((x-1)^1)+1)
#define mp(x,y) make_pair(x,y)
#define clr(f,n) memset(f,0,sizeof(int)*(n))
#define cpy(f,g,n) memcpy(f,g,sizeof(int)*(n))
#define INF 0x3f3f3f3f

using namespace std;

namespace fastIO
{
    #define BUF_SIZE 100000
    bool IOerror=0;
    inline char nc()
	{
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
        if(p1==pend)
		{
            p1=buf;
            pend=buf+fread(buf,1,BUF_SIZE,stdin);
            if(pend==p1)
			{
                IOerror=1;
                return -1;
            }
        }
        return *p1++;
    }
    inline bool blank(char ch)
	{
        return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';
    }
    inline int read()
	{
		int ans=0,f=1;
		char c=nc();
		while(c>'9'||c<'0'){if(c=='-')f=-1;c=nc();}
		while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=nc();}
		return ans*f;
	}
    #undef BUF_SIZE
};

using namespace fastIO;

inline void write(long long x)
{
	if(x<0) putchar('-'),x=-x;
	if(x/10) write(x/10);
	putchar((char)(x%10)+'0');
}

template<typename T>inline T Abs(T a){return a>0?a:-a;};
template<typename T,typename TT>inline T Min(T a,TT b){return a<b?a:b;}
template<typename T,typename TT> inline T Max(T a,TT b){return a<b?b:a;}

const int N=5e5+5;
int n,m,nn,block,a[N],b[N],L,R;
long long now,ans[N];

struct Node
{
	int l,r,id;
	bool operator < (const Node &x)const
	{
		if(l/block==x.l/block)
		{
			int tmp=l/block;
			if(tmp%2==1)
				return r<x.r;
			return r>x.r;
		}
		return l<x.l;
	}
}c[N];

struct BIT
{
	int c[N],all;
	inline void add(int x,int v)
	{
		all+=v;
		for(;x<=nn;x+=lowbit(x))
			c[x]+=v;
	}
	inline int query1(int x)
	{
		int res=0;
		for(;x;x-=lowbit(x))
			res+=c[x];
		return res;
	}
	inline int query2(int k)
	{
		int l=1,r=nn,mid;
		while(l^r)
			c[mid=(l+r)>>1]<k?(k-=c[mid],l=mid+1):r=mid;
		return l;
	}
	inline int pre(int x)
	{
		int tmp=query1(x-1);
		if(tmp==0) return -1;
		return query2(query1(x-1));
	}
	inline int suc(int x)
	{
		int tmp=query1(x);
		if(all==tmp) return -1;
		return query2(query1(x)+1);
	}
}sum;

inline void add(int x)
{
	int lf=(a[x]==1?-1:sum.pre(a[x]));
	int rf=(a[x]==n?-1:sum.suc(a[x]));
	if(lf!=-1) now+=abs(b[lf]-x);
	if(rf!=-1) now+=abs(b[rf]-x);
	if(lf!=-1&&rf!=-1) now-=abs(b[lf]-b[rf]);
	sum.add(a[x],1);
}

inline void del(int x)
{
	int lf=(a[x]==1?-1:sum.pre(a[x]));
	int rf=(a[x]==n?-1:sum.suc(a[x]));
	if(lf!=-1) now-=abs(b[lf]-x);
	if(rf!=-1) now-=abs(b[rf]-x);
	if(lf!=-1&&rf!=-1) now+=abs(b[lf]-b[rf]);
	sum.add(a[x],-1);
}

signed main()
{
	//freopen("rrads.in","r",stdin);
	//freopen("rrads.out","w",stdout);
	n=read();m=read();nn=1;
	for(int i=1;i<=n;++i)
		a[i]=read(),b[a[i]]=i;
	while(nn<n) nn<<=1;
	block=n/((int)sqrt(m));
	for(int i=1;i<=m;++i)
	{
		c[i].l=read();
		c[i].r=read();
		c[i].id=i;
	}
	sort(c+1,c+1+m);L=1;R=0;
	for(int i=1;i<=m;++i)
	{
		while(L>c[i].l) add(--L);
		while(R<c[i].r) add(++R);
		while(L<c[i].l) del(L++);
		while(R>c[i].r) del(R--);
		ans[c[i].id]=now;
	}
	for(int i=1;i<=m;++i)
		write(ans[i]),puts("");
	return 0;
}