#include <bits/stdc++.h>

using namespace std;

int main(){
    int N,Q;
    cin >> N >> Q;
    vector<pair<int, int>> A;
    vector<int> B;
    for (int i=0;i<N;++i){
    int a;
    cin >> a;
    A.push_back({a,i+1});
    B.push_back(a);
    }
    
    sort(B.begin(), B.end());
    B.erase(unique(B.begin(), B.end()), B.end());
    map<int, int> C;
    for (int i=0; i<N; ++i){
        C[A[i].second] = lower_bound(B.begin(), B.end(), A[i].first)-B.begin();
    }

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