#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=998244353;
const ll N=500009;
struct num{
	ll val,id;
};
num a[N],b[N];
bool cmp(num f,num g){
	return f.val<g.val;
}
ll n,m;
void input(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){cin>>a[i].val; a[i].id=i;}
	for(int i=1;i<=n;i++) b[i]=a[i];
}
void solveBF(){
	for(int i=1;i<=m;i++){
		ll ans=0;
		ll c,d;
		cin>>c>>d;
		sort(b+c,b+d+1,cmp);
		for(int j=c;j<=d-1;j++){
			ans+=abs(b[j].id-b[j+1].id);
		}
		cout<<ans<<endl;
	}
}
void solve(){

}
int main(){
	input();
	if(n<=1000&&m<=1000) solveBF();
	else solve();
	return 0;
}