#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<array>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
const int N=1000010;
int n,q;
int a[N],c[N],pos[N],pre[N];
ll ans[N];
vpii vecq[N];
int st[20][N];
int qmax(int l,int r){
	int k=__lg(r-l+1);
	return max(st[k][l],st[k][r-(1<<k)+1]);
}
int getpos(int o,int x){
	int l=o,r=n,as=n+1,mid;
	while(l<=r){
		mid=(l+r)>>1;
		if(qmax(o,mid)>x)as=mid,r=mid-1;
		else l=mid+1;
	}
	return as;
}
inline int lowbit(int x){return x&(-x);}
int tree[N];
void modify(int x,int v){for(;x<=n;x+=lowbit(x))tree[x]+=v;}
int query(int x){
	int s=0;
	for(;x;x-=lowbit(x))s+=tree[x];
	return s;
}
signed main(){
	#ifdef do_while_true
//		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n,q);
	for(int i=1;i<=n;i++)read(a[i]),st[0][i]=a[i];
	for(int i=1;i<=19;i++)
		for(int j=1;j+(1<<i)-1<=n;j++)
			st[i][j]=max(st[i-1][j],st[i-1][j+(1<<(i-1))]);
	for(int i=1;i<=q;i++){
		int l,r;read(l,r);
		vecq[l].pb(mp(r,i));
	}
	vi vec;
	for(int l=n;l>=1;l--){
		pre[l]=a[l];
		if(pre[l+1]<a[l]){
			pos[l]=getpos(l+1,a[l]);
			modify(pos[l],1);
		}
		else{
			if(pre[l+1]==a[l]){
				int o=pos[l+1]+1;
				pos[l]=getpos(o,a[l]);
				modify(pos[l],1);
			}
			else{
				int R=n+1;
				for(int i=l+1;i<=n;i++)
					if(pre[i]<=a[l]){
						R=i;
						break;
					}
					else pre[i]=a[l];
				while(!vec.empty()&&vec.back()<=R-1){
					int t=vec.back();
					modify(pos[t],-1);
					pos[t]=t;
					modify(t,1);
					vec.pop_back();
				}
				if(pre[R]==a[l]){
					pos[l]=getpos(pos[R]+1,a[l]);
				}
				else{
					pos[l]=getpos(R,a[l]);
				}
				modify(pos[l],1);
			}
		}
		vec.pb(l);
		for(auto o:vecq[l]){
			int r=o.fi,id=o.se;
			ans[id]=query(r);
		}
	}
	for(int i=1;i<=q;i++)cout<<ans[i]<<'\n';
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}