#include <fstream>
#define NMax 100005
#define LMax 18
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N,M,RMQ[LMax][NMax],X[NMax],Log2[NMax];
void BuildLog2()
{
    for(int i=2;i<=N;i++)
        Log2[i]=Log2[i/2]+1;
}
void BuildRMQ()
{
    for(int i=1;i<=N;i++)
        RMQ[0][i]=X[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))]);
                }
        }

}
int main()
{
    fin>>N>>M;
    for(int i=1;i<=N;i++)
        fin>>X[i];
    BuildLog2();
    BuildRMQ();
    while(M--)
    {
        int x,y;
        fin>>x>>y;
        int diff=y-x+1;
        int k=Log2[diff];
        fout<<min(RMQ[k][x],RMQ[k][y-(1<<k)+1])<<"\n";
    }
    return 0;
}