#include <bits/stdc++.h>
using namespace std;
template <class X, class Y>
void minimize(X &x, const Y &y) {
  if (x > y) x = y;
}
template <class X, class Y>
void maximize(X &x, const Y &y) {
  if (x < y) x = y;
}
int a[100100], b[100100];
int ___left[100100], ___right[100100];
int n, q;
void init(void) {
  scanf("%d%d", &n, &q);
  for (int i = (1), _b = (n); i <= _b; i = i + 1) scanf("%d", &a[i]);
  for (int i = (1), _b = (n - 1); i <= _b; i = i + 1)
    b[i] = max(a[i + 1] - a[i], a[i] - a[i + 1]);
}
void prepare(void) {
  stack<int> st;
  for (int i = (1), _b = (n - 1); i <= _b; i = i + 1) {
    while (!st.empty() && b[st.top()] <= b[i]) st.pop();
    ___left[i] = st.empty() ? 0 : st.top();
    st.push(i);
  }
  while (!st.empty()) st.pop();
  for (int i = (n - 1), _a = (1); i >= _a; i = i - 1) {
    while (!st.empty() && b[st.top()] < b[i]) st.pop();
    ___right[i] = st.empty() ? n : st.top();
    while (!st.empty() && b[st.top()] <= b[i]) st.pop();
    st.push(i);
  }
}
long long answer(int l, int r) {
  long long res = 0;
  for (int i = (l), _b = (r - 1); i <= _b; i = i + 1)
    res += 1LL * b[i] * (i - max(___left[i] + 1, l) + 1) *
           (min(___right[i], r) - i);
  return (res);
}
void process(void) {
  for (int love = 0, _n = (q); love < _n; love = love + 1) {
    int l, r;
    scanf("%d%d", &l, &r);
    cout << answer(l, r) << "\n";
  }
}
int main(void) {
  init();
  prepare();
  process();
  return 0;
}
