#include <fstream>

using namespace std;

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

int r[30][1000001];
int log[1000001];

int main()
{
    int n, m;
    in >> n >> m;
    for(int j = 1; j <= n; j++){
        in >> r[0][j];
    }
    for(int i = 1; (1 << i) <= n; i++){
        for(int j = 1; j + (1 << i) - 1 <= n; j++){
            r[i][j] = min(r[i - 1][j] , r[i - 1][j + (1 << (i - 1))]);
        }
    }
    log[1] = 0;
    for(int i = 2; i <= n; i++){
        log[i] = 1 + log[i / 2];
    }
    for(int i = 1; i <= m; i++){
        int p, q;
        in >> p >> q;
        int l = log[q - p + 1];
        out << min(r[l][p] , r[l][q - (1 << l) + 1]) << "\n";
    }


    return 0;
}