#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,q,a[200001];
struct node{
	int l,r;
}b[200001];
int main(){
	freopen("dry.in","r",stdin);
	freopen("dry.out","w",stdout);
	cin>>n>>q;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=q;i++) cin>>b[i].l>>b[i].r;
	for(int i=1;i<=q;i++){
		vector<int> v;
		ll ans=0;
		for(int j=b[i].l;j<=b[i].r;j++) v.push_back(a[j]);
		for(int j=0;j<b[i].r-b[i].l;j++){
			if(v[j]!=0){
				ans++;
				for(int k=j+1;k<b[i].r-b[i].l;k++){
					if(v[k]>=v[j]){
						if(v[k]!=v[j]||(k==b[i].r-b[i].l-1||v[k]!=v[k+1])) ans++;
						v[k]=0;
					}
				}
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}