#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,i,j,p,P,S[17][100005],x,y;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(j=1;j<=n;j++) scanf("%d",&S[0][j]);
    for(p=1,P=2,i=1;P<=n;i++,p<<=1,P<<=1)
        for(j=1;j<=n-P+1;j++)
            S[i][j]=min(S[i-1][j],S[i-1][j+p]);
    for(;m;m--)
    {
        scanf("%d%d",&x,&y);
        for(i=0,p=1;p*2<=y-x+1;i++,p<<=1);
        printf("%d\n",min(S[i][x],S[i][y-p+1]));
    }
    return 0;
}