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

int N,Q,v[Nmax],lg[Nmax],RMQ[LgMax][Nmax];

int main()
{
    f>>N>>Q;
    for(int i=1;i<=N;++i)f>>v[i];
    for(int i=2;i<=N;++i)lg[i]=lg[i/2]+1;
    for(int i=1;i<=N;++i)RMQ[0][i]=v[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)
    {
        int left,right;
        f>>left>>right;  //if (left>right)swap(left,right);
        int diff=right-left+1;
        int log=lg[diff];
        int sol= min( RMQ[log][left] , RMQ[log][right-(1<<log)+1] );
        g<<sol<<'\n';
    }
    f.close();g.close();
    return 0;
}