#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int nmax = 100005, mmax = 1000005;
int n, m, rmq[18][nmax];
int e[nmax];
int main(){
    f >> n >> m;
    for(int i = 1; i <= n; i++){
        f >> rmq[0][i];
    }
    for(int p = 1; (1 << p) <= n; p++){
        for(int i = 1; i <= n; i++){
            rmq[p][i] = rmq[p - 1][i];
            int j = i + (1 << (p - 1));
            if(j <= n && rmq[p][i] > rmq[p - 1][j]){
                rmq[p][i] = rmq[p - 1][j];
            }
        }
    }
    e[1] = 0;
    for(int i = 2; i <= n; i++){
        e[i] = 1 + e[i / 2];
    }
    for(int t = 1; t <= m; t++){
        int st, dr;
        f >> st >> dr;
        int len = (1 << e[dr - st + 1]);
        g << min(rmq[e[dr - st + 1]][st], rmq[e[dr - st + 1]][dr - len + 1]) << '\n';
    }
}