#include<iostream>
#include<fstream>
#define N_MAX 131072
#define logN_MAX 17

int M[logN_MAX+1][N_MAX];

inline int min(int a, int b)
{
    if (a<=b) return a;
    return b;
}

int main()
{
    std::ifstream f("rmq.in");
    std::ofstream g("rmq.out");

    int i, j, n, m, a, b, k, h;
    f >> n >> m;
    for (i=1; i<=n; i++)
        f >> M[1][i];
    for (i=2, k=2; k<=n; i++, k<<=1)
        for (j=1; j<=n; j++)
        {
            M[i][j]=min(M[i-1][j], M[i-1][j+k/2]);
        }
    for (i=1; i<=m; i++)
    {
        f >> a >> b;
        k=1; h=1; while(k<<1<=b-a+1) {k<<=1; h++;}
        g << min(M[h][a], M[h][b-k+1]) << std::endl;
    }
    f.close();
    g.close();
    return 0;
}