#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int A[24][10000],n,m,x,y,lg[100000],h,d;
int min(int a, int b)
{
    return (a>b) ? b:a;
}
int main()
{
    f>>n>>m;
    lg[1]=0;
    for (int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(int i=1;i<=n;++i)
        f>>A[0][i];
    for(int i=1;i<=lg[n];++i)
        for(int j=1;j<=(n-(1<<i)+1);++j)
            A[i][j]=min(A[i-1][j],A[i-1][j+(1<<(i-1))]);
    for(;m;--m)
    {
        f>>x>>y;
        h=lg[y-x+1];
        d=y-x+1-(1<<h);
        g<<min(A[h][x], A[h][x+d])<<'\n';
    }
    return 0;
}