#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ii, ii> iii;
ll MOD = 1e9 + 9;
const ld E = 1e-7;
#define null NULL
#define ms(x) memset(x, 0, sizeof(x))
#ifndef LOCAL
#define endl "\n"
#endif
#ifndef LONG_LONG_MAX
#define LONG_LONG_MAX LLONG_MAX
#endif
#define sync ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define _read(x) freopen(x, "r", stdin)
#define _write(x) freopen(x, "w", stdout)
#define files(x) _read(x ".in"); _write(x ".out")
#define filesdatsol(x) _read(x ".dat"); _write(x ".sol")
#define output _write("output.txt")
#define input _read("input.txt")
#define prev time_prev
#define M_PI acos(-1)
#define remove tipa_remove
#define left tipa_left
#define right tipa_right
#define next tipa_next
#define mod % MOD
#define y1 hello_world
unsigned char ccc;
bool _minus = false;
template<typename T>
inline T sqr(T t) {
	return (t * t);
}
inline void read(ll &n) {
	n = 0;
	_minus = false;
	while (true) {
		ccc = getchar();
		if (ccc == ' ' || ccc == '\n')
			break;
		if (ccc == '-') {
			_minus = true;
			continue;
		}
		n = n * 10 + ccc - '0';
	}
	if (_minus)
		n *= -1;
}
inline void read(int &n) {
	n = 0;
	_minus = false;
	while (true) {
		ccc = getchar();
		if (ccc == ' ' || ccc == '\n')
			break;
		if (ccc == '-') {
			_minus = true;
			continue;
		}
		n = n * 10 + ccc - '0';
	}
	if (_minus)
		n *= -1;
}
char wwww[19];
int kkkk;
inline void write(ll y) {
	long long x = y;
	kkkk = 0;
	if (x < 0) {
		putchar('-');
		x *= -1;
	}
	if (!x)
		++kkkk, wwww[kkkk] = '0';
	else
		while (x) {
			++kkkk;
			wwww[kkkk] = char(x % 10 + '0');
			x /= 10;
		}
	for (int i = kkkk; i >= 1; --i)
		putchar(wwww[i]);
}

#ifdef LOCAL
#define DEBUG
#endif

#ifdef DEBUG
#define dbg if(1)
#else
#define dbg if(0)
#endif

const int MAX = 5e5 + 10;
const int MAX_LOG = 20;
int _log2[MAX];
int ar[MAX];
int t1[MAX_LOG][MAX], t2[MAX_LOG][MAX];
int n;

void build() {
	for (int i = 2; i < MAX; i++) {
		_log2[i] = _log2[i >> 1] + 1;
	}
	for (int i = 1; i <= n; i++) {
		cin >> ar[i];
		t1[0][i] = t2[0][i] = ar[i];
	}
	for (int i = 1; i < MAX_LOG; i++) {
		for (int j = 1; j + (1 << i) - 1 <= n; j++) {
			t1[i][j] = max(t1[i - 1][j], t1[i - 1][j + (1 << (i - 1))]);
			t2[i][j] = min(t2[i - 1][j], t2[i - 1][j + (1 << (i - 1))]);
		}
	}
}

int get(int l, int r) {
	int i = _log2[r - l + 1];
	return max(t1[i][l], t1[i][r - (1 << i) + 1])
			- min(t2[i][l], t2[i][r - (1 << i) + 1]);
}

ll solve(int a) {
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		int l = i, r = n;
		while (l < r) {
			int x = (l + r + 1) >> 1;
			if (get(i, x) <= a) {
				l = x;
			} else {
				r = x - 1;
			}
		}
		ans += l - i + 1;
	}
	return ans;
}

ll solve(int a, int b) {
	return solve(b) - solve(a - 1);
}

int solve_long(int a, int b) {
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		int L = 0, R = 1e9;
		for (int j = i; j <= n; j++) {
			L = max(L, ar[j]);
			R = min(R, ar[j]);
			if (a <= L - R && L - R <= b) {
				ans++;
			}
		}
	}
	return ans;
}

int main() {
	sync;
	srand(time(NULL));
	cout.precision(3);
	cout << fixed;
#ifdef LOCAL
	input;
#else

#endif

	int q;
	cin >> n >> q;
	build();

	while(q--) {
		int a, b;
		cin >> a >> b;
		cout << solve(a, b) << endl;
	}

}