#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10, LOGN = 30, INF = 0x3f3f3f3f;
#define pii pair<int, int>
int T;
int n, q;
int lm[MAXN][LOGN];
int a[MAXN], inva[MAXN];
int dp[MAXN];
stack<int> stk;

int Get(int u, int lim) {
	int len = 20;
	for (int i = 20; i >= 0; i--) 
		if (lm[u][i] < lim) u = lm[u][i];
	u = lm[u][0];
	return u;
}

int main() {
	scanf("%d", &T);

	while (T--) {
		scanf("%d%d", &n, &q);
		for (int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
			inva[a[i]] = i;
		}
		stk.push(INF);
		for (int i = 1; i <= n; i++) {
			while (stk.top() < a[i]) {
				int tmp = stk.top(); stk.pop();
				lm[inva[tmp]][0] = i;
			}
			stk.push(a[i]);
		}
		while (stk.size() != 1) {
			int tmp = stk.top(); stk.pop();
			lm[inva[tmp]][0] = n + 1;
		}
		stk.pop();


		lm[n + 1][0] = n + 1;
		// for (int i = 1; i <= n; i++) 
		// 	printf("%d ", lm[i][0]);
		// puts("");
		for (int i = 1; i <= 20; i++) {
			for (int j = 1; j <= n + 1; j++) 
				lm[j][i] = lm[lm[j][i - 1]][i - 1];
		}
		dp[n + 1] = 0;
		for (int i = n; i >= 1; i--) {
			if (lm[i][0] - i != 1) 
				dp[i] = dp[lm[i][0]] + 1;
			else dp[i] = dp[lm[i][0]];
			// printf("%d %d\n", dp[i], lm[i][0]);
		}
		// for (int i = 1; i <= n; i++) 
		// 	printf("%d ", dp[i]);
		// puts("");
		int l, r;
		for (int i = 1; i <= q; i++) {
			scanf("%d%d", &l, &r);
			if (l == r) printf("%d\n", 0);
			else {
				r = Get(l, r);
				// printf("qwe%d %d\n", l, r);
				printf("%d\n", dp[l] - dp[r]);
			}
		}
	}
	return 0;
}