#include <bits/stdc++.h>
using namespace std;
const long long maxn = 100010;
long long n, q, cnt, h[maxn], S[maxn], top, L[maxn], R[maxn];
long long query(long long len) { return len * (len + 1) / 2; }
void solve(long long l, long long r) {
  long long res = 0;
  top = 0;
  memset(L, 0, sizeof(L));
  memset(R, 0, sizeof(R));
  memset(S, 0, sizeof(S));
  S[0] = l - 1;
  for (long long i = l; i <= r; i++) {
    while (top && h[S[top]] <= h[i]) top--;
    L[i] = S[top] + 1;
    S[++top] = i;
  }
  top = 0;
  memset(S, 0, sizeof(S));
  S[0] = r + 1;
  for (long long i = r; i >= l; i--) {
    while (top && h[S[top]] < h[i]) top--;
    R[i] = S[top] - 1;
    S[++top] = i;
  }
  for (long long i = l; i <= r; i++) {
    res += h[i] * ((i - L[i] + 1) * (R[i] - i + 1));
  }
  printf("%lld\n", res);
}
int main() {
  scanf("%lld%lld", &n, &q);
  for (long long i = 1; i <= n; i++) scanf("%lld", &h[i]);
  for (long long i = n; i >= 2; i--) h[i] = abs(h[i] - h[i - 1]);
  while (q--) {
    long long l, r;
    scanf("%lld%lld", &l, &r);
    if (l == r)
      puts("0");
    else {
      l++;
      solve(l, r);
    }
  }
  return 0;
}
