#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using mint=atcoder::modint998244353;
int N,Q,A[1<<17];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>N>>Q;
    for(int i=0;i<N;i++)cin>>A[i];
    vector<int>B(A,A+N);
    sort(B.begin(),B.end());
    while(Q--)
    {
        int x,y;
        cin>>x>>y;
        x--,y--;
        int X=lower_bound(B.begin(),B.end(),A[x])-B.begin();
        int Y=upper_bound(B.begin(),B.end(),A[y])-B.begin();
        cout<<max(0,X-Y)<<'\n';
    }
}