#include <fstream>
#include <cmath>

using namespace std;

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

int main()
{
    int N, M;
    in >> N >> M;
    int dp[N + 1][(int)log2(N) + 1];
    for(int i = 1; i <= N; ++i)
    {
        in >> dp[i][0];
    }
    for(int j = 1; (1 << j) <= N; ++j)
        for(int i = 1; i - (1 << j) <= N; ++i)
            dp[i][j] = min(dp[i][j - 1], dp[i - (1 << (j - 1))][j - 1]);

    /*for(int i = 1; i <= N; ++i)
    {
        for(int j = 0; (1 << j) <= N; ++j)
            out << dp[i][j] << " ";
        out << '\n';
    }*/
    int l, r;
    while(M--)
    {
        in >> l >> r;
        int len = log2(r - l + 1);
        out << min(dp[r][len], dp[r - (1 << len) + 1][len]) << '\n';
    }
    return 0;
}