#include <fstream>

using namespace std;

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

const int NMAX = 100005;
int n,m;
int v[NMAX];
int log2[NMAX];
int pow2[NMAX];
int rmq[18][NMAX];

void read()
{
    fin >> n >> m;
    for(int i = 0; i < n; ++i){
        fin >> v[i];
    }
}

void buildPow2()
{
    pow2[0] = 1;
    for(int i = 1; i < 18; ++i){
        pow2[i] = pow2[i - 1] * 2;
    }
}

void buildLogs()
{
    log2[1] = 0;
    for(int i = 2; i < NMAX; ++i){
        log2[i] = log2[i / 2] + 1;
    }
}

void buildRMQ()
{
    for(int i = 0; i < n; ++i){
        rmq[0][i] = v[i];
    }
    for(int k = 1; k < 18; ++k){
        for(int i = 0; i < n; ++i){
            if(i < n - pow2[k - 1]){
                rmq[k][i] = min(rmq[k - 1][i], rmq[k - 1][i + pow2[k - 1]]);
            }
            else{
                rmq[k][i] = rmq[k - 1][i];
            }
        }
    }
}

void precalculate()
{
    buildPow2();
    buildLogs();
    buildRMQ();
}

void solve()
{
    for(int i = 0; i < m; ++i){
        int l,r;
        fin >> l >> r;
        --l;
        --r;
        int k = log2[r - l + 1];
        fout << min(rmq[k][l], rmq[k][r - pow2[k] + 1]) << '\n';
    }
}

int main()
{
    read();
    precalculate();
    solve();
    return 0;
}