#include <bits/stdc++.h>

using namespace std;
long long dp[20][200000], A[200000], n;
long long vector[200000];
long long lg[200000];

int main(){
    ifstream f ("rmq.in");
    ofstream g("rmq.out");
    int i,j, a, b , m;
    f >> n >> m;
    for ( i = 2; i <= n ; i++)
    {
        lg[i] = lg[i >> 1] + 1;
    }
    for ( i = 1; i <= n; i++)
    {
        f >> A[i];
    }
    for ( i = 1; i <= n; i++)
    {
        dp[0][i] = i;
    }
    for (i = 1;  (1<< i) <= n; ++i)
    {
        for (j = 1; j + (1 << i) - 1 <= n; j++)
        {

            dp[i][j] = dp[i - 1][j];
            if (dp[i - 1][j + (1 << (i - 1))] and A[dp[i][j]] > A[dp[i - 1][j + (1 << (i - 1))]])
            {
                dp[i][j] = dp[i - 1][j + (1 << (i - 1))];
            }
        }
    }
    for ( i = 1; i <= m; i++)
    {
        f >> a >> b;
        int c = b - a;
        int k = lg[c];
        // cout << min(A[dp[a - 1][k]],A[dp[b - 1 - (1 << k ) + 1 ][k]]) << endl;
        g << min(A[dp[lg[c]][a]], A[dp[lg[c]][b - ((1 << lg[c]) - 1 )]]) << endl;

    }
    return 0;
}