#include <bits/stdc++.h>
using namespace std;

int main() {
    int N,Q; cin >> N >> Q;
    vector<pair<int,int>> A(N);
    for(int i=0; i<N; i++){
        int a; cin >> a;
        A.at(i) = {a,i};
    }
    sort(A.begin(),A.end());
    vector<int> rev(N);
    for(int i=0; i<N; i++) rev.at(A.at(i).second) = i;

    while(Q--){
        int x,y; cin >> x >> y;
        x--; y--;
        auto [a1,ig] = A.at(rev.at(x));
        auto [a2,ign] = A.at(rev.at(y));

        if(a1 <= a2){cout << 0 << endl; continue;}
        int pos1 = upper_bound(A.begin(),A.end(),make_pair(a2,N+1))-A.begin();
        int pos2 = lower_bound(A.begin(),A.end(),make_pair(a1,-1))-A.begin();
        cout << pos2-pos1 << endl;
    }
}