#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int r[20][1000005];
int E[1000005];
int n, m;

void precalc() {

    E[1] = 0;
    for (int i = 2; i <= n; i++) {
        E[i] = 1 + E[i / 2];
    }
}



int main()
{
    fin >> n >> m;
    precalc();
    for (int i = 1; i <= n; i++) {
        fin >> r[0][i];
    }

        
    for (int p = 1; (1 << p) <= n; p++) {
        for (int i = 1; i <= n; i++) {
            r[p][i] = r[p - 1][i];
            int j = i + (1 << (p-1));
            if ( j<= n && r[p][i] > r[p - 1][j]) {
                r[p][i]= r[p - 1][j];
            }
        }
    }

    int st, dr;
    for (int i = 1; i <= m; i++) {
        fin >> st >> dr;
        int e = E[dr - st + 1];
        fout << min(r[e][st], r[e][dr - (1 << e) + 1])<<'\n';

    }

    fin.close();
    fout.close();

}