#include <iostream>
#include <fstream>
using namespace std;

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

const int maxN = 1e5 + 5;

int rmq[30][maxN];
int log[maxN], n;

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

void rmq_ ()
{
    for(int j = 1; j <= log[n]; ++j)
        for(int i = 1; i + (1 << j) <= n + 1; ++i)
            rmq[j][i] = min(rmq[j-1][i], rmq[j-1][i + (1 << (j-1))]);
}

int main()
{
    int m; fin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        int x; fin >> x;
        rmq[0][i] = x;
    }
    init_log();
    rmq_();
    for(int i = 1; i <= m; ++i) {
        int a, b; fin >> a >> b;
        int j = log[b - a + 1];
        fout << min(rmq[j][a], rmq[j][b - (1 << j) + 1]) << "\n";
    }
    return 0;
}