// Problem: P11367 [Ynoi2024] 魔法少女网站第二部
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P11367
// Memory Limit: 512 MB
// Time Limit: 3000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define uint unsigned
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

namespace IO {
	const int maxn = 1 << 20;
	
    char ibuf[maxn], *iS, *iT, obuf[maxn], *oS = obuf;

	inline char gc() {
		return (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, maxn, stdin), (iS == iT ? EOF : *iS++) : *iS++);
	}

	template<typename T = int>
	inline T read() {
		char c = gc();
		T x = 0;
		bool f = 0;
		while (c < '0' || c > '9') {
			f |= (c == '-');
			c = gc();
		}
		while (c >= '0' && c <= '9') {
			x = (x << 1) + (x << 3) + (c ^ 48);
			c = gc();
		}
		return f ? ~(x - 1) : x;
	}

	inline void flush() {
		fwrite(obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	
	struct Flusher {
		~Flusher() {
			flush();
		}
	} AutoFlush;

	inline void pc(char ch) {
		if (oS == obuf + maxn) {
			flush();
		}
		*oS++ = ch;
	}

	template<typename T>
	inline void write(T x) {
		static char stk[64], *tp = stk;
		if (x < 0) {
			x = ~(x - 1);
			pc('-');
		}
		do {
			*tp++ = x % 10;
			x /= 10;
		} while (x);
		while (tp != stk) {
			pc((*--tp) | 48);
		}
	}
	
	template<typename T>
	inline void writesp(T x) {
		write(x);
		pc(' ');
	}
	
	template<typename T>
	inline void writeln(T x) {
		write(x);
		pc('\n');
	}
}

using IO::read;
using IO::write;
using IO::pc;
using IO::writesp;
using IO::writeln;

const int maxn = 2000100;
const int inf = 0x3f3f3f3f;

int n, m, a[maxn], b[maxn];
struct node {
	int l, r;
} c[maxn];

ll ans[maxn];

struct List {
	int hd[maxn], len, val[maxn << 1], nxt[maxn << 1];
	
	inline void add(int x, int y) {
		val[++len] = y;
		nxt[len] = hd[x];
		hd[x] = len;
	}
} G;

namespace SGT {
	int m, a[maxn << 2];
	
	inline void init() {
		m = 1;
		while (m <= n + 1) {
			m <<= 1;
		}
		mems(a, 0x3f);
	}
	
	inline void update(int x, int d) {
		a[x += m] = d;
		while (x >>= 1) {
			a[x] = min(a[x << 1], a[x << 1 | 1]);
		}
	}
	
	inline int query(int l, int r) {
		if (l > r) {
			return inf;
		}
		int ans = inf;
		for (l += m - 1, r += m + 1; l ^ r ^ 1; l >>= 1, r >>= 1) {
			if (!(l & 1)) {
				ans = min(ans, a[l ^ 1]);
			}
			if (r & 1) {
				ans = min(ans, a[r ^ 1]);
			}
		}
		return ans;
	}
}

namespace BIT {
	ll c[maxn];
	
	inline void update(int x, int d) {
		for (int i = x; i <= n; i += (i & (-i))) {
			c[i] += d;
		}
	}
	
	inline void update(int l, int r, int x) {
		update(l, x);
		update(r + 1, -x);
	}
	
	inline ll query(int x) {
		ll res = 0;
		for (int i = x; i; i -= (i & (-i))) {
			res += c[i];
		}
		return res;
	}
	
	inline void clear(int x) {
		for (int i = x; i <= n; i += (i & (-i))) {
			c[i] = 0;
		}
	}
}

struct DS {
	int a[maxn], b[maxn];
	
	inline void init() {
		mems(a, 0);
		mems(b, 0x3f);
	}
	
	inline void insert(int x) {
		for (int i = x; i <= n; i += (i & (-i))) {
			a[i] = max(a[i], x);
		}
		for (int i = x; i; i -= (i & (-i))) {
			b[i] = min(b[i], x);
		}
	}
	
	inline int prev(int x) {
		int res = 0;
		for (int i = x; i; i -= (i & (-i))) {
			res = max(res, a[i]);
		}
		return res;
	}
	
	inline int next(int x) {
		int res = inf;
		for (int i = x; i <= n; i += (i & (-i))) {
			res = min(res, b[i]);
		}
		return res;
	}
	
	inline void clear(int x) {
		for (int i = x; i <= n; i += (i & (-i))) {
			a[i] = 0;
		}
		for (int i = x; i; i -= (i & (-i))) {
			b[i] = inf;
		}
	}
} S;

void dfs(int l, int r, vector<int> Q) {
	if (l == r || Q.empty()) {
		return;
	}
	int mid = (l + r) >> 1;
	G.len = 0;
	for (int i = l; i <= r; ++i) {
		G.hd[i] = 0;
	}
	vector<int> L, R;
	for (int i : Q) {
		if (c[i].r <= mid) {
			L.pb(i);
		} else if (c[i].l > mid) {
			R.pb(i);
		} else {
			G.add(c[i].l, i);
			G.add(c[i].r, i);
		}
	}
	ll s = 0;
	int mn = inf, mx = 0;
	for (int i = mid + 1; i <= r; ++i) {
		SGT::update(a[i], i);
	}
	for (int i = mid; i >= l; --i) {
		mn = min(mn, a[i]);
		mx = max(mx, a[i]);
		int j = S.prev(a[i]), k = S.next(a[i]);
		S.insert(a[i]);
		if (j) {
			s += abs(i - b[j]);
			int t = SGT::query(j + 1, a[i] - 1);
			if (t <= r) {
				BIT::update(t, r, (mid - max(i, b[j])) * 2);
			}
		}
		if (k <= n) {
			s += abs(i - b[k]);
			int t = SGT::query(a[i] + 1, k - 1);
			if (t <= r) {
				BIT::update(t, r, (mid - max(i, b[k])) * 2);
			}
		}
		if (j && k <= n) {
			s -= abs(b[j] - b[k]);
			int t = SGT::query(j + 1, k - 1);
			if (t <= r) {
				BIT::update(t, r, -(mid - max(b[j], b[k])) * 2);
			}
		}
		for (int _ = G.hd[i]; _; _ = G.nxt[_]) {
			int j = G.val[_];
			ans[j] += s + BIT::query(c[j].r);
			if (SGT::query(mx + 1, n) <= c[j].r) {
				ans[j] += mid - b[mx];
			}
			if (SGT::query(1, mn - 1) <= c[j].r) {
				ans[j] += mid - b[mn];
			}
		}
	}
	for (int i = l; i <= mid; ++i) {
		S.clear(a[i]);
	}
	for (int i = mid + 1; i <= r + 1; ++i) {
		BIT::clear(i);
	}
	for (int i = mid + 1; i <= r; ++i) {
		SGT::update(a[i], inf);
	}
	s = mx = 0;
	mn = inf;
	for (int i = l; i <= mid; ++i) {
		SGT::update(a[i], -i);
	}
	for (int i = mid + 1; i <= r; ++i) {
		mn = min(mn, a[i]);
		mx = max(mx, a[i]);
		int j = S.prev(a[i]), k = S.next(a[i]);
		S.insert(a[i]);
		if (j) {
			s += abs(i - b[j]);
			int t = -SGT::query(j + 1, a[i] - 1);
			if (t >= l) {
				BIT::update(l, t, (min(i, b[j]) - mid) * 2);
			}
		}
		if (k <= n) {
			s += abs(i - b[k]);
			int t = -SGT::query(a[i] + 1, k - 1);
			if (t >= l) {
				BIT::update(l, t, (min(i, b[k]) - mid) * 2);
			}
		}
		if (j && k <= n) {
			s -= abs(b[j] - b[k]);
			int t = -SGT::query(j + 1, k - 1);
			if (t >= l) {
				BIT::update(l, t, -(min(b[j], b[k]) - mid) * 2);
			}
		}
		for (int _ = G.hd[i]; _; _ = G.nxt[_]) {
			int j = G.val[_];
			ans[j] += s + BIT::query(c[j].l);
			if (-SGT::query(mx + 1, n) >= c[j].l) {
				ans[j] += b[mx] - mid;
			}
			if (-SGT::query(1, mn - 1) >= c[j].l) {
				ans[j] += b[mn] - mid;
			}
		}
	}
	for (int i = l; i <= mid + 1; ++i) {
		BIT::clear(i);
	}
	for (int i = l; i <= mid; ++i) {
		SGT::update(a[i], inf);
	}
	for (int i = mid + 1; i <= r; ++i) {
		S.clear(a[i]);
	}
	exit(0);
	dfs(l, mid, L);
	dfs(mid + 1, r, R);
}

void solve() {
	n = read();
	m = read();
	for (int i = 1; i <= n; ++i) {
		a[i] = read();
		b[a[i]] = i;
	}
	vector<int> Q;
	for (int i = 1; i <= m; ++i) {
		c[i].l = read();
		c[i].r = read();
		if (c[i].l != c[i].r) {
			Q.pb(i);
		}
	}
	SGT::init();
	S.init();
	dfs(1, n, Q);
	for (int i = 1; i <= m; ++i) {
		writeln(ans[i]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}