#include <fstream>
#include <cmath>

using namespace std;

ifstream fin ("rmq.in");
ofstream fout("rmq.out");

const int NMAX = 10005;

int n, m, a, b;
int l[NMAX];
int rmq[NMAX][30];
int v[NMAX];

int main(){
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    for (int i = 2; i <= n; i++)
        l[i] = l[i/2] + 1;
    for (int i = 1; i <= n; i++)
        rmq[i][0] = i;

    for (int j = 1; (1 << j) <= n; j++) {
        for (int i = 1; i <= n - (1 << j) + 1; i++) {
            if (v[rmq[i][j - 1]] < v[rmq[i + (1 << (j - 1))][j - 1]])
                rmq[i][j] = rmq[i][j - 1];
            else
                rmq[i][j] = rmq[i + (1 << (j - 1))][j - 1];
        }
    }

    for (int i = 1; i <= m; i++) {
        fin >> a >> b;
        int k = l[b - a + 1];
        int sol = min(v[rmq[a][k]], v[rmq[b - (1 << k) + 1][k]]);
        fout << sol << '\n';
    }

    return 0;
}