#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (1 << 20);
long long n, q;
long long a[MAXN];
void read() {
  cin >> n >> q;
  for (long long i = 1; i <= n; i++) cin >> a[i];
}
long long next_bad_word[MAXN], prev_bad_word[MAXN];
long long solve(long long lbound, long long rbound) {
  long long ans = 0;
  for (long long i = lbound; i <= rbound - 1; i++) {
    long long l = max(prev_bad_word[i] + 1, lbound),
              r = min(next_bad_word[i] - 1, rbound - 1);
    ans += a[i] * (i - l + 1) * (r - i + 1);
  }
  return ans;
}
long long abs_my_function(long long v) { return v < 0 ? -v : v; }
void solve() {
  for (long long i = 1; i <= n - 1; i++)
    a[i] = abs_my_function(a[i] - a[i + 1]);
  stack<long long> st;
  for (long long i = 1; i <= n - 1; i++) {
    while (!st.empty() && a[st.top()] < a[i]) st.pop();
    if (st.empty())
      prev_bad_word[i] = 0;
    else
      prev_bad_word[i] = st.top();
    st.push(i);
  }
  while (!st.empty()) st.pop();
  for (long long i = n - 1; i >= 1; i--) {
    while (!st.empty() && a[st.top()] <= a[i]) st.pop();
    if (st.empty())
      next_bad_word[i] = n;
    else
      next_bad_word[i] = st.top();
    st.push(i);
  }
  while (q--) {
    long long l, r;
    cin >> l >> r;
    cout << solve(l, r) << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  read();
  solve();
  return 0;
}
