#include <bits/stdc++.h>
#define ll long long 
using namespace std;

struct section
{
	ll l, r, num;
};

ll n, m, l, r, i, len, a[500001], f[500001], b[500001], ans[500001]; 
section sec[500001];
set < ll > s;


bool cmp(section l, section r)
{
	return b[l.l] ^ b[r.l] ? l.l < r.l : (b[l.l] & 1 ? l.r < r.r : l.r > r.r);
}

void move(ll pos1, ll opt)
{
	if (opt > 0)
		s.insert(a[pos1]);
		
	set < ll >::iterator pos, end, last, next;
	
	pos = s.find(a[pos1]);
	end = s.end();
	
	if (pos != s.begin())
	{
		last = --pos;
		pos++;
	}
	
	if (pos != --end)
	{
		next = ++pos;
		pos--;
	}
	
	if (pos == s.begin())
		ans[i] += abs(f[*next] - f[*pos]) * opt;
	
	else if (pos == end)
		ans[i] += abs(f[*last] - f[*pos]) * opt;	
	
	else
		ans[i] += (abs(f[*next] - f[*pos]) + abs(f[*pos] - f[*last]) - abs(f[*last] - f[*next])) * opt;
	
	if (opt < 0)
		s.erase(pos);	
	
}


int main()
{

	scanf("%d%d", &n, &m);
	
	len = sqrt(n);
	
	for(i = 1; i <= n; i++)
	{
		scanf("%d", a + i);
		f[a[i]] = i;
		b[i] = (i - 1) / len;
	}
	
	for(i = 1; i <= m; sec[i].num = i, i++)	
		scanf("%d%d", &sec[i].l, &sec[i].r);
		
	sort(sec + 1, sec + m + 1, cmp);
	
	l = 1;
	r = 1;
	
	s.insert(a[1]);
	
	for (i = 1; i <= m; i++)
	{
		ans[i] = ans[i - 1];
		
		while (l > sec[i].l)
			move(--l, 1);
			
		while (r < sec[i].r)
			move(++r, 1);
			
		while (l < sec[i].l)
			move(l++, -1);		
		
		while (r > sec[i].r)
			move(r--, -1);
	}
	
	for (i = 1; i <= m; i++)
		printf("%d\n", ans[sec[i].num]);
}