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

int N, M, RMQ[17][100002], lg[100002], x, y, Log;

int main()
{
    f>>N>>M;
    for (int i=1; i<=N; ++i)
        f>>x, RMQ[0][i]=x;
    for (int i=2; i<=N; ++i)
        lg[i]=lg[i/2]+1;
    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<=M; ++i)
    {
        f>>x>>y; Log=lg[y-x+1];
        g<<min( RMQ[Log][x], RMQ[Log][y-(1<<Log)+1])<<'\n';
    }
    return 0;
}