#include <iostream>
#include <fstream>

using namespace std;
 
ifstream in("rmq.in");
ofstream out("rmq.out");
 
const int Nmax = 100005;
int n, m, v[Nmax], log2[Nmax], query[20][Nmax], x, y, len, p2, offset;

int main() {
    in >> n >> m;
    for(int i = 1; i <= n; ++ i)
        in >> v[i];
 
    log2[1] = 0;
    for(int i = 2; i <= n; ++ i)
        log2[i] = log2[i >> 1] + 1;
 
    for(int i = 1; i <= n; ++ i)
        query[0][i] = v[i];
 
    for(int i = 1; (1 << i) <= n; ++ i)
        for(int j = 1; j <= n - (1 << i) + 1; ++ j)
            query[i][j] = min(query[i - 1][j], query[i - 1][j + (1 << (i - 1))]);
 
    for(int i = 1; i <= m; ++ i) {
        in >> x >> y;
        len = y - x + 1;
        p2 = log2[len];
        offset = len - (1 << p2);
        out << min(query[p2][x], query[p2][x + offset]) << '\n';
    }
 
    return 0;
}