//O(NlogN), O(1)

#include <fstream>
#define in "rmq.in"
#define out "rmq.out"
#define Max_Size 100004
#define log2_Max_Size 18

std :: ifstream f(in);
std :: ofstream g(out);

int N, M;
int log2[Max_Size], ST[log2_Max_Size + 2][Max_Size];    //Sparse Table

inline void Read_Data()
{
    f >> N >> M;

    for(int i = 1; i <= N; ++i) f >> ST[0][i];
}

inline void Solve()
{
    for(int i = 2; i < N; ++i)  log2[i] = log2[i / 2] + 1;

    for(int k = 1; (1 << k) < N; ++k)
        for(int i = 1; i <= N; ++i)
            ST[k][i] = ( i + (1 << (k - 1)) <= N ? std :: min(ST[k - 1][i], ST[k - 1][i + (1 << (k - 1))]) : ST[k - 1][i]);
}

inline void RMQ()
{
    int a, b;

    for(int i = 1; i <= M; ++i)
    {
        f >> a >> b;

        int k = log2[b - a + 1];

        g << std :: min(ST[k][a], ST[k][b - (1 << k) + 1]) << '\n';
    }
}

int main()
{
    Read_Data();
    Solve();
    RMQ();

    g.close();
    return 0;
}