#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#ifdef DEBUG
template<class T>
ostream& operator << (ostream &out,vector<T> a){
	out<<'[';
	for(T x:a)out<<x<<',';
	return out<<']';
}
template<class T>
vector<T> ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<class T>
void debug(T x){
	cerr<<x<<endl;
}
template<class T,class...S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
#else
#define debug(...) void()
#endif
const int N=1e6+10;
int n,m,a[N],pre[N],suf[N];
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int l,r;m--;){
		scanf("%d%d",&l,&r);
		pre[l-1]=n+1,suf[r+1]=0;
		for(int i=l;i<=r;i++)pre[i]=min(pre[i-1],a[i]);
		for(int i=r;i>=l;i--)suf[i]=max(suf[i+1],a[i]);
		int ans=0;
		for(int i=l;i<=r;i++)ans+=pre[i]==a[i]&&suf[i]==a[i];
		printf("%d\n",(r-l+1)-ans);
	}
	return 0;
}