#include // #include using namespace std; #define rep(i, N) for (int i = 0; i < N; i++) #define inner(y) (0 <= y && y < N) typedef long long ll; const ll MOD = 998244353; const ll INF = 1LL << 60; #ifdef USE_MY_LIBS #include "mylib/all" #endif // 配列の標準出力ユーティリティ(デバッグ用) #ifdef _MY_DEBUG template void checkArray1D(T& a, int width = 10) { ll nrow = (ll)a.size(); for (int i = 0; i < nrow; i++) { cout << setw(width) << a[i] << " "; } cout << endl; } template void checkArray2D(T& a, int width = 10) { ll nrow = (ll)a.size(); ll ncol = (ll)a[0].size(); for (int i = 0; i < nrow; i++) { for (int j = 0; j < ncol; j++) { cout << setw(width) << a[i][j] << " "; } cout << endl; } } #endif int main() { int N, Q; cin >> N >> Q; vector A(N); vector As(N); rep(i, N) { cin >> A[i]; As[i] = A[i]; } sort(As.begin(), As.end()); rep(i, Q) { int x, y; cin >> x >> y; x--; y--; int r = lower_bound(As.begin(), As.end(), A[x]) - As.begin(); int l = upper_bound(As.begin(), As.end(), A[y]) - As.begin(); cout << max(r - l, 0) << endl; } return 0; }