#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f, mod = 1e9 + 7;
const int maxn = 1e5 + 1000;
const long double PI = acos(-1.0);
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
long long power(long long a, long long n, long long mod) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
int n, q;
long long a[maxn], st[maxn], le[maxn], re[maxn], g[maxn];
long long stt(int l, int r) {
  memset(le, 0, sizeof(le));
  memset(re, 0, sizeof(re));
  int top = -1;
  for (int i = l; i <= r; i++) {
    le[i] = 1;
    while (a[i] >= st[top] && top != -1) {
      le[i] += le[g[top]];
      top--;
    }
    st[++top] = a[i];
    g[top] = i;
  }
  top = -1;
  for (int i = r; i >= l; i--) {
    re[i] = 1;
    while (a[i] > st[top] && top != -1) {
      re[i] += re[g[top]];
      top--;
    }
    st[++top] = a[i];
    g[top] = i;
  }
  long long sum = 0;
  for (int i = l; i <= r; i++) sum += a[i] * (le[i]) * (re[i]);
  return sum;
}
int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    a[i - 1] = abs(a[i] - a[i - 1]);
  }
  for (int i = 1; i <= q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    cout << stt(l, r - 1) << endl;
  }
  return 0;
}
