#include <bits/stdc++.h>
#define il inline
#define re register
#define ll long long
using namespace std;
namespace FastIO {
  const int iL = 1 << 20;
  char ibuf[iL], *iS = ibuf + iL, *iT = ibuf + iL;
  #define GC() (iS == iT) ? \
  (iT = (iS = ibuf) + fread(ibuf, 1, iL, stdin), (iS == iT) ? EOF : *iS++) : *iS++
  template <class T>il void read(T &x) {
    x = 0;
    char c = GC(); bool flg = false;
    while(!isdigit(c)) {flg |= c == '-'; c = GC();}
    while(isdigit(c)) {x = (x << 1) + (x << 3) + (c & 15); c = GC();}
    if(flg) x = -x;
  }
  char Out[iL], *iter = Out;
  #define Flush() fwrite(Out, 1, iter - Out, stdout); iter = Out
  template <class T>il void write(T x, char LastChar = '\n') {
    int c[35], len = 0;
    if(x < 0) {*iter++ = '-'; x = -x;}
    do {c[++len] = x % 10; x /= 10;} while(x);
    while(len) *iter++ = c[len--] + '0';
    *iter++ = LastChar; Flush();
  }
}
using namespace FastIO;
#define N 500005
int n, m, a[N];
int tr[N << 1], L = 1;
struct Querys {
  int l, r, id, bl;
  il bool operator < (const Querys &tmp) const {
    return bl ^ tmp.bl ? l < tmp.l : bl & 1 ? r < tmp.r : r > tmp.r;
  }
} q[N];
ll rev[N], Ans[N], ans;
il int GetPre(const int &x) {
  re int y = x + L;
  while(y > 1) {
    if(y & 1 && tr[y >> 1] > tr[y]) break;
    y >>= 1;
  }
  if(y == 1) return -1;
  y ^= 1;
  while(y <= L) {
    if(tr[y << 1 | 1]) y = y << 1 | 1;
    else y <<= 1;
  }
  return y - L;
}
il int GetNxt(const int &x) {
  re int y = x + L;
  while(y > 1) {
    if(!(y & 1) && tr[y >> 1] > tr[y]) break;
    y >>= 1;
  }
  if(y == 1) return -1;
  y ^= 1;
  while (y <= L) {
    if(tr[y << 1]) y <<= 1;
    else y = y << 1 | 1;
  }
  return y - L;
}
il void Add(const int &id) {
  // printf("Add %d\n", x);
  re int x = a[id], pre = GetPre(x), nxt = GetNxt(x);
  // printf("Pre Nxt %d %d\n", pre, nxt);
  if(~pre) ans += abs(id - rev[pre]);
  if(~nxt) ans += abs(id - rev[nxt]);
  if(~pre && ~nxt) ans -= abs(rev[pre] - rev[nxt]);
  x += L; tr[x] = 1; x >>= 1;
  while(x) {
    tr[x] = tr[x << 1] + tr[x << 1 | 1];
    x >>= 1;
  }
}
il void Del(const int &id) {
  // printf("Del %d\n", x);
  re int x = a[id], pre = GetPre(x), nxt = GetNxt(x);
  // printf("Pre Nxt %d %d\n", pre, nxt);
  if(~pre) ans -= abs(id - rev[pre]);
  if(~nxt) ans -= abs(id - rev[nxt]);
  if(~pre && ~nxt) ans += abs(rev[pre] - rev[nxt]);
  x += L; tr[x] = 0; x >>= 1;
  while(x) {
    tr[x] = tr[x << 1] + tr[x << 1 | 1];
    x >>= 1;
  }
}
int main() {
  // freopen("1.txt", "r", stdin);
  // freopen("2.txt", "w", stdout);
  read(n); read(m);
  for(re int i = 1; i <= n; ++i) {
    read(a[i]); rev[a[i]] = i;
  }
  const int B = 275;
  for(re int i = 1; i <= m; ++i) {
    read(q[i].l); read(q[i].r);
    q[i].id = i; q[i].bl = (q[i].l - 1) / B + 1;
  }
  sort(q + 1, q + 1 + m);
  while(L <= n) L <<= 1;
  // printf("%d\n", L);
  for(re int i = 1, l = 1, r = 0; i <= m; ++i) {
    while(l > q[i].l) Add(--l);
    while(r < q[i].r) Add(++r);
    while(l < q[i].l) Del(l++);
    while(r > q[i].r) Del(r--);
    // printf("Now Ans %d\n", ans);
    Ans[q[i].id] = ans;
  }
  for(re int i = 1; i <= m; ++i) write(Ans[i]);
  return 0;
}