#include <bits/stdc++.h>
const int oo = 0x3f3f3f3f;
template <typename T>
inline bool chkmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
template <typename T>
inline bool chkmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
template <typename T>
T read(T &first) {
  int f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (first = 0; isdigit(ch); ch = getchar()) first = 10 * first + ch - '0';
  return first *= f;
}
template <typename T>
void write(T first) {
  if (first < 0) {
    putchar('-');
    first = -first;
  }
  static char s[20];
  int top = 0;
  for (; first; first /= 10) s[++top] = first % 10 + '0';
  if (top == 0)
    putchar('0');
  else
    while (top) putchar(s[top--]);
}
const int MAXN = 1e5 + 5;
int N, Q;
long long A[MAXN];
void input() {
  read(N);
  read(Q);
  for (int i = 1; i <= N; ++i) {
    read(A[i]);
  }
}
void solve() {
  static long long D[MAXN];
  for (int i = 1; i < N; ++i) {
    D[i] = std::abs(A[i] - A[i + 1]);
  }
  while (Q--) {
    int l, r;
    read(l);
    read(r);
    static long long lb[MAXN], ub[MAXN];
    static long long st[MAXN];
    int top = 0;
    long long bak = D[l - 1];
    D[l - 1] = LONG_LONG_MAX;
    st[++top] = l - 1;
    for (int i = l; i < r; ++i) {
      while (D[st[top]] < D[i]) {
        ub[st[top--]] = i;
      }
      lb[i] = st[top] + 1;
      st[++top] = i;
    }
    while (top > 0) {
      ub[st[top--]] = r;
    }
    D[l - 1] = bak;
    long long ans = 0;
    for (int i = l; i < r; ++i) {
      ans += (ub[i] - i) * (i - lb[i] + 1) * D[i];
    }
    write(ans);
    putchar('\n');
  }
}
int main() {
  input();
  solve();
  return 0;
}
