#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define ll long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=2e5+5;
const int mod=998244353;
inline int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}
int T;
int a[maxn];
pii q[maxn];
vector<int> e[maxn];
int st[maxn],top;
int now[maxn],tp,ans[maxn],las[maxn];
signed main()
{
	T=read();
	while(T--)
	{
		int n=read(),m=read();
		top=0;tp=0;
		rep(i,1,n) a[i]=read(),e[i].clear();
		las[n]=n;
		per(i,n-1,1) 
		{
			if(a[i]>a[i+1]) las[i]=i;
			else las[i]=las[i+1];
		}
		rep(i,1,m) {int x=read(),y=read();q[i]=mp(x,y);}
		rep(i,1,m) e[q[i].fi].push_back(i);
		st[++top]=n+1;a[n+1]=1e9;
		now[++tp]=n+1;
		per(i,n,1)
		{
			while(top&&a[st[top]]<a[i]) --top;
			if(st[top]!=i+1) 
			{
				while(tp&&now[tp]<st[top]) --tp;
				if(now[tp]!=st[top]) now[++tp]=st[top];	
			}
			st[++top]=i;
			for(auto j:e[i])
			{
				int R=q[j].second;
				int l=1,r=tp,res=tp+1;
				while(l<=r)
				{
					int mid=(l+r)/2;
					if(now[mid]<=R) r=mid-1,res=mid;
					else l=mid+1; 
				}
				ans[j]=tp-res+1;
				int p=i;if(res<=tp) p=now[res];
				if(las[p]<R) ans[j]++;
			}
		}				
		rep(i,1,m) printf("%lld\n",ans[i]);
	}
}