#include "bits/stdc++.h"

/*
#include "boost/multiprecision/cpp_int.hpp"
namespace mp = boost::multiprecision;
using i128=mp::cpp_int;
*/

using namespace std;
typedef long long ll;
typedef int64_t i64;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define drep(i,a,n) for(int i=a;i>n;i--)
#define yes(ans) if(ans)cout<<"yes"<<endl;else cout<<"no"<<endl;
#define Yes(ans) if(ans)cout<<"Yes"<<endl;else cout<<"No"<<endl;
#define YES(ans) if(ans)cout<<"YES"<<endl;else cout<<"NO"<<endl;
#define iINF 1000000007
#define lINF 10000000000007
#define llINF 4000000000000000007
#define all(x) x.begin(),x.end()
#define so(x) sort(all(x))
#define re(x) reverse(all(x))
const double PI = acos(-1);
int main(){
    int n,q; cin>>n>>q;
    vvi a(n,vi(2)); rep(i,0,n){cin>>a[i][0]; a[i][0]=1000000000-a[i][0]; a[i][1]=i;}
    so(a);
    vi top(n),bot(n);
    int x=-1;
    vi now(0);
    rep(i,0,n){
        if(x==a[i][0]){
            now.push_back(a[i][1]);
        }
        else{
            for(int j:now){
                bot[j]=i-1;
            }
            x=a[i][0];
            now={a[i][1]};
        }
        if(i==n-1){
            for(int j:now){
                bot[j]=i;
            }
        }
    }
    
    x=-1;
    now={};
    drep(i,n-1,-1){
        if(x==a[i][0]){
            now.push_back(a[i][1]);
        }
        else{
            for(int j:now){
                top[j]=i+1;
            }
            x=a[i][0];
            now={a[i][1]};
        }
        if(i==0){
            for(int j:now){
                top[j]=i;
            }
        }
    }
    
    //rep(i,0,n) cout<<top[i]<<" "<<bot[i]<<endl;
    
    
    int k,l;
    rep(i,0,q){
        cin>>k>>l; k--; l--;
        if(top[k]>=top[l]) cout<<0<<endl;
        else{
            cout<<top[l]-bot[k]-1<<endl;
        }
    }
}