#include <fstream>
#include <algorithm>

using namespace std;

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

const int Nmax = 100005;

int logaritm[Nmax];
int dp[20][Nmax];

int main()
{
    int n, m;
    in >> n >> m;

    for (int i = 1; i <= n; i++)
        in >> dp[0][i];

    for (int i = 2; i <= n; i++)
        logaritm[i] = logaritm[i / 2] + 1;

    for (int i = 1; (1<<i) <= n; i++)
    {
        int k = 1 << (i - 1);

        for (int j = 1; j <= n - k + 1; j++)
            dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + k]);
    }

    for (int i = 1; i <= m; i++)
    {
        int a, b;
        in >> a >> b;

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

        out << min(dp[k][a], dp[k][b - (1 << k) + 1]) << '\n';
    }

    return 0;
}