#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(x) x.begin(), x.end()
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
#include <atcoder/all>
using namespace atcoder;
//using mint=static_modint<998244353>;
using mint=static_modint<1000000007>;

ll n,q;
vector<int> a;

int main(){
	cin>>n>>q;
    a.resize(n);
    rep(i,n)cin>>a[i];
    priority_queue<P,vector<P>,greater<P>> pq;
    rep(i,n)pq.push({a[i],i});
    vector<int> pos(n);
    int cnt=0;
    map<int,int> mp;
    while(!pq.empty()){
        P p=pq.top();pq.pop();
        pos[p.second]=cnt;
        cnt++;
        mp[p.first]++;
    }

    rep(i,q){
        int x,y;cin>>x>>y;
        x--;y--;
        cout<<max(0,pos[x]-pos[y]-mp[a[x]])<<endl;
    }
}