#include <fstream>
#include <cmath>
#include <vector>

using namespace std;

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

int main()
{
    int N, M;
    in >> N >> M;
    vector<vector<int>> dp(N + 1, vector<int> (int(log2(N) + 10), 0));
    for(int i = 1; i <= N; ++i)
        in >> dp[i][0];
    for(int j = 1; (1 << j) <= N; ++j)
        for(int i = (1 << (j - 1)); i <= N; ++i)
    dp[i][j] = min(dp[i][j - 1], dp[i - (1 << (j - 1))][j - 1]);
    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;
}