#include<iostream> #include<vector> #include<algorithm> #include<map> #include<set> using namespace std; int main() { int n,q; cin >> n >> q; vector<int>a(n); for(int i=0;i<n;i++)cin >> a[i]; vector<int>b=a; sort(b.begin(),b.end()); map<int,int>dict,dict2; set<int>st; for(int i=0;i<n;i++){ if(st.count(b[i]))dict2[b[i]]=i; else{ st.insert(b[i]); dict[b[i]]=i; dict2[b[i]]=i; } } for(;q--;){ int x,y; cin >> x >> y; cout << max(0,dict[a[x-1]]-dict2[a[y-1]]-1) << endl; } }