#include <bits/stdc++.h>

using namespace std;

#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1<<21, stdin), p1 == p2) ? EOF : *p1++)
char buf[1 << 21],*p1 = buf,*p2 = buf;
inline int read()
{
    char c = getchar();
    int x = 0;
    bool f = 0;
    for(;!isdigit(c); c = getchar()) f ^= !(c ^ 45);
    for(;isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
    if (f) x = -x; 
    return x;
}

int n, m, a[500005], b[500005], pos[500005];
long long anslist[500005];
int len;
struct query{
    int l, r, idx;
    bool operator<(query a) {
        if (l / len == a.l / len) return r > a.r;
        else return l / len < a.l / len; 
    }
}q[500005];

struct node {
    int val, next, prev;
}lis[500005];
#define head lis[0]
#define tail lis[n + 1]
long long ans, tmp, now;

void del(int p, long long& x) {
    if (lis[p].prev == 0) x -= abs(p - lis[p].next);
    else if (lis[p].next == n + 1) x -= abs(p - lis[p].prev);
    else if (lis[p].prev == 0 && lis[p].next == n + 1) x = 0;
    else x = x - abs(p - lis[p].prev) - abs(p - lis[p].next) + abs(lis[p].next - lis[p].prev);
    lis[lis[p].prev].next = lis[p].next;
    lis[lis[p].next].prev = lis[p].prev;
}

void rcv(int p) {
    lis[lis[p].prev].next = p;
    lis[lis[p].next].prev = p;
}

int main() {
    scanf("%d%d", &n, &m);
    len = sqrt(n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    for (int i = 1; i <= n; i++)
        lis[i].val = a[i];
    for (int i = 1; i <= n; i++)
        pos[a[i]] = i;
    memcpy(b, a, sizeof a);
    sort(b + 1, b + n + 1);
    for (int i = 1; i < n; i++) {
        ans += abs(pos[b[i]] - pos[b[i + 1]]);
    }
    head.next = pos[b[1]];
    lis[pos[b[1]]].prev = 0;
    for (int i = 1; i < n; i++) {
        lis[pos[b[i]]].next = pos[b[i + 1]];
        lis[pos[b[i + 1]]].prev = pos[b[i]];
    }
    tail.prev = pos[b[n]];
    lis[pos[b[n]]].next = n + 1;
    for (int i = 1; i <= m; i++)
        scanf("%d%d", &q[i].l, &q[i].r);
    for (int i = 1; i <= m; i++)
        q[i].idx = i;
    sort (q + 1, q + m + 1);
    now = ans;
    //cout << ans;
    for (int i = 1, l = 1, r = n; i <= m; i++) {
        if (q[i].l / len != q[i - 1].l /len) {
            while (l < (q[i].l - 1) / len * len + 1) del(l++, now);
            r = n;
            tmp = ans = now;
        }
        while (r > q[i].r) del(r--, ans);
        tmp = ans;
        while (l < q[i].l) del(l++, tmp);
        anslist[q[i].idx] = tmp;
        while (l > (q[i].l - 1) / len * len + 1) rcv(l--);
    }
    for (int i = 1; i <= m; i++) printf("%lld\n", anslist[i]);
    return 0;
}