#include <bits/stdc++.h>
using namespace std;
const double PI = acos(0) * 2;
const double EPS = 1e-8;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int oo = 1e9;
const double foo = 1e30;
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcounll(s);
}
int a[100100], n;
long long solve(int l, int r) {
  vector<long long> d;
  int L[100100], R[100100];
  stack<pair<int, int> > st;
  memset(L, 0, sizeof L);
  memset(R, 0, sizeof R);
  d.clear();
  d.push_back(oo);
  for (int i = l + 1; i <= r; i++) {
    int x = abs(a[i] - a[i - 1]);
    d.push_back(x);
  }
  d.push_back(oo);
  st.push(make_pair(d[0], 0));
  int N = ((int)(d).size());
  for (int i = 1; i < ((int)(d).size()); i++) {
    while (st.top().first < d[i]) st.pop();
    L[i] = st.top().second;
    st.push(make_pair(d[i], i));
  }
  while (!st.empty()) st.pop();
  st.push(make_pair(d[N - 1], N - 1));
  for (int i = N - 2; i >= 1; i--) {
    while (!st.empty() && st.top().first <= d[i]) st.pop();
    R[i] = st.top().second;
    st.push(make_pair(d[i], i));
  }
  long long ret = 0;
  for (int i = 1; i <= N - 2; i++) {
    long long l = L[i] + 1;
    long long r = R[i] - 1;
    l = i - l + 1;
    r = r - i + 1;
    long long x = (l * r) * d[i];
    ret += x;
  }
  return ret;
}
int main() {
  int q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    printf("%I64d\n", solve(l, r));
  }
}
