#include <bits/stdc++.h>

using namespace std;

int main(){
    int N, Q;
    cin >> N >> Q;
    vector<pair<int, int>> A;
    for (int i=0; i<N; ++i){
        int a;
        cin>>a;
        A.push_back(make_pair(a, i+1));
        }
    sort(A.begin(), A.end());
    map<int,int> A_;
    int rank=1;

    for (int i=0;i<N-1;++i){
        A_[A[i].second]=rank;
        if ((A[i].first!=A[i+1].first)){++rank;}
    }
    A_[A[N-1].second]=rank;

    for (int _=0; _<Q; ++_){
        int x, y;
        cin >> x >> y;
        int ans = A_[x]-A_[y]-1;
        if ((ans)>=0){cout << ans << endl;}
        else {cout<<0<<endl;}
    }
}