1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 using namespace std;
 5 const int maxn=4e5+5;
 6 int n,m;
 7 class segTree{
 8 public:
 9     int a[maxn],s[maxn*4];
10     void build(int node,int begin,int end){
11         if(begin==end){
12             s[node]=begin;
13         }else{
14             build(2*node,begin,(begin+end)/2);
15             build(2*node+1,(begin+end)/2+1,end);
16             if(a[s[2*node]]>=a[s[2*node+1]])
17                 s[node]=s[2*node];
18             else
19                 s[node]=s[2*node+1];
20         }
21     }
22     int query(int node,int begin,int end,int left,int right,int low_bound){
23         if(left>end||right<begin)
24             return -1;
25 //        if(begin>=left&&end<=right)
26 //            return s[node];
27         if(begin==end){
28             if(a[begin]>low_bound)return begin;
29             return -1;
30         }
31         int q1,q2;
32         if(a[s[2*node]]>low_bound)return query(2*node,begin,(begin+end)/2,left,right,low_bound);
33         if(a[s[2*node+1]]>low_bound)return query(2*node+1,(begin+end)/2+1,end,left,right,low_bound);
34         return -1;
35     }
36 }st;
37 int Max[maxn],sum_front[maxn],sum_back[maxn];
38 int h[maxn];
39 int main(){
40 //    freopen("e:\\in.txt","r",stdin);
41     scanf("%d%d",&n,&m);
42     Max[0]=0,sum_front[0]=0;
43     for(int i=1;i<=n;i++){
44         scanf("%d",&h[i]);
45         st.a[i]=h[i];
46         if(h[i]>Max[i-1]){
47             sum_front[i]=sum_front[i-1]+1;
48             Max[i]=h[i];
49         }else{
50             sum_front[i]=sum_front[i-1];
51             Max[i]=Max[i-1];
52         }
53     }
54     int k;
55     ta.init(n);
56     st.build(1,1,n);
57     sum_back[n]=1;
58     for(int i=n-1;i>=1;i--){
59         k=st.query(1,1,n,i+1,n,h[i]);
60         if(k!=-1)sum_back[i]=1+sum_back[k];
61         else sum_back[i]=1;
62     }
63     int a,b;
64     for(int i=0;i<m;i++){
65         scanf("%d%d",&a,&b);
66         int ans=sum_front[a-1];
67         if(b>Max[a-1]){
68             ans++;
69             k=st.query(1,1,n,a+1,n,b);
70             if(k!=-1)ans+=sum_back[k];
71         }else{
72             k=st.query(1,1,n,a+1,n,Max[a-1]);
73             if(k!=-1)
74             ans+=sum_back[k];
75         }
76         printf("%d\n",ans);
77     }
78     return 0;
79 }