#include <bits/stdc++.h>

using namespace std;
#define MOD 1000003

int n, m, v[100001], a[10001][10001];

int main() {
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> v[i];

    for(int i = 1; i <= n; i++) {
        a[i][i] = i;
        for(int j = i + 1; j <= n; j++) {
            if(v[a[i][j-1]] > v[j])
                a[i][j] = j;
            else
                a[i][j] = a[i][j-1];
        }
    }
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        cout << v[a[x][y]] << endl;
    }

    return 0;
}