#include <fstream>

using namespace std;
int v[100005], dp[40][100005], n, m, log[100005];
int minim (int a, int b)
{
    if (a>b)
        return b;
    return a;
}
int main()
{
    ifstream fin ("rmq.in");
    ofstream fout ("rmq.out");
    fin >> n >> m;
    for (int i = 2; i<=n; ++i)
        log[i] = log[i>>1]+1;
    int i, put = 1, p = 0, a, b, dif, j;
    p = log[n]+1;
    for (i = 1; i<=n; ++i)
    {
        fin >> v[i];
        if (i>=2)
            dp[0][i-1] = min (v[i], v[i-1]);
    }
    dp[0][n] = v[n];
    for (i = 1; i<=p; ++i)
        for (j = 1; j<=n; ++j)
            if (j+(1<<(i-1)) <= n) dp[i][j] = min(dp[i-1][j], dp[i-1][j+(1<<(i-1))]);
    for (i=0; i<m; ++i)
    {
        fin >> a >> b;
        if (a == b)
            fout << v[a] << '\n';
        else {
        dif = b-a+1;
        p = log[dif]-1;
        fout << minim(dp[p][a], dp[p][b-(1<<p)]) << '\n';}
    }
    return 0;
}