#include <fstream>

using namespace std;

const int N = 1e5;
const int L = 16;

int rmq[L+1][N+1], log_2[N+1], n;

void constructie_rmq_log()
{
    for (int i = 1; i <= L; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            int p = 1 << (i - 1);
            rmq[i][j] = min(rmq[i-1][j-p], rmq[i-1][j]);
        }
    }
    log_2[1] = 0;
    for (int i = 2; i <= n; i++)
    {
        log_2[i] = 1 + log_2[i/2];
    }
}

int minim(int st, int dr)
{
    int lung = dr - st + 1;
    int e = log_2[lung];
    int p = (1 << e);///puterea maxima a lui 2 care e <= lung
    return min(rmq[e][st+p-1], rmq[e][dr]);
}

int main()
{
    ifstream in("rmq.in");
    ofstream out("rmq.out");
    int q;
    in >> n >> q;
    for (int j = 1; j <= n; j++)
    {
        in >> rmq[0][j];
    }
    constructie_rmq_log();
    for (int i = 0; i < q; i++)
    {
        int st, dr;
        in >> st >> dr;
        out << minim(st, dr) << "\n";
    }
    in.close();
    out.close();
    return 0;
}