#include<bits/stdc++.h>
using namespace std;
inline int qread()
{
	int a=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
	return a*f;
}
int n,m,a[1000010],R[1000010],que[1000010],ed,ans[1000010];
vector< pair<int,int> >U[1000010],Q[1000010];
struct fenwick
{
	int val[1000010];
	inline void adds(int p,int x){for(;p<=n;p+=p&-p)val[p]+=x;return ;}
	inline int Qs(int p){int an=0;for(;p;p-=p&-p)an+=val[p];return an;}
}t;
inline int solve(int x,int p)
{
	while(p<=n&&a[++p]<=x);
	return p;
}
int main()
{
	n=qread();m=qread();
	for(int i=1;i<=n;++i)a[i]=qread();
	for(int i=1,l,r;i<=m;++i)
	{
		l=qread(),r=qread();
		Q[l].emplace_back(make_pair(r,i));
	}
	for(int i=n;i;--i)
	{
		while(ed&&a[que[ed]]>a[i])
		{
			t.adds(que[ed],-1);
			t.adds(R[que[ed]],1);
			--ed;
		}
		R[i]=solve(a[i],a[i]==a[que[ed]]?R[que[ed]]:que[ed]);
		t.adds(i,1);t.adds(R[i],-1);que[++ed]=i;
		for(pair<int,int>j:Q[i])ans[j.second]=j.first-i+1-t.Qs(j.first);
	}
	for(int i=1;i<=m;++i)printf("%d\n",ans[i]-1);
	return 0;
}