#include using namespace std; template using min_priority_queue = priority_queue,greater>; template void printv(vector &v){ bool b = false; for(auto i : v){ if(b) cout << " "; else b = true; cout << i; } cout << endl; } template bool chmin(T &a, const T& b) { if (a > b) { a = b; // aをbで更新 return true; } return false; } template bool chmax(T &a, const T& b) { if (a < b) { a = b; // aをbで更新 return true; } return false; } void yn(bool b){ if(b) cout << "Yes" << endl; else cout << "No" << endl; } bool debug; bool randomInput; bool debugOutput; int numOfTestCase; using ans_type = int; void input(){ if(numOfTestCase > 1){ ; } if(randomInput){ } else{ } return; } void output_input(){ ; } ans_type calc(){ int N, Q; cin >> N >> Q; vector A(N); for(auto &a : A) { cin >> a; a *= -1; } vector> B(N); for(int i = 0; i < N; i++){ B[i] = {A[i], i}; } sort(B.begin(), B.end()); vector Idx(N); for(int i = 0; i < N; i++) Idx[B[i].second] = i; for(int i = 0; i < Q; i++){ int x, y; cin >> x >> y; x--; y--; int a = B[Idx[x]].first; int b = B[Idx[y]].first; //cout << a << " " << b << endl; int ans = lower_bound(B.begin(), B.end(), make_pair(b, 0)) - upper_bound(B.begin(), B.end(), make_pair(a, N)); chmax(ans, 0); cout << ans << endl; } return ans_type(); } ans_type calc_simple(){ return ans_type(); } void output(ans_type ans){ return; } int main(){ debug = 0; randomInput = 0; debugOutput = 0; numOfTestCase = 1; srand(time(NULL)); cout << fixed << setprecision(12); if(numOfTestCase == 0) cin >> numOfTestCase; if(debug){ for(int i = 0; i < numOfTestCase; i++){ input(); ans_type ans = calc(); ans_type ansSimple = calc_simple(); if(ans != ansSimple){ output_input(); output(ans); output(ansSimple); } } } else{ for(int i = 0; i < numOfTestCase; i++){ input(); output(calc()); } } return 0; }