#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");

int N, Q, a[100002], lg[100002], RMQ[21][100002], st, dr, dif, Log;

int main()
{
    f>>N>>Q;
    for (int i=1; i<=N; ++i)f>>a[i];
    for (int i=2; i<=N; ++i) lg[i]=lg[i/2]+1;
    for (int i=1; i<=N; ++i) RMQ[0][i]=a[i];

    for (int i=1; (1<<i)<=N; ++i)
        for (int j=1; j<=N-(1<<i)+1; ++j)
            RMQ[i][j]=min( RMQ[i-1][j], RMQ[i-1][j+(1<<(i-1))]);

    for (int i=1; i<=Q; ++i)
    {
        f>>st>>dr; dif=dr-st+1; Log=lg[dif];
        int sol=min(RMQ[Log][st], RMQ[Log][dr-(1<<Log)+1]);
        g<<sol<<'\n';
    }
    return 0;
}