#include<cstdio>
#include<algorithm>
using namespace std;
int lg[100010],x,y,n,q,mat[20][100010];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);


    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;++i){
        scanf("%d",&x);
        mat[0][i]=x;
    }
    lg[1]=0;
    for(int i=2;i<=n;++i)
        lg[i]=lg[i/2]+1;
    for(int i=1;i<=lg[n];++i)
        for(int j=1;j<=n;++j)
            mat[i][j]=min(mat[i-1][j],mat[i-1][j+(1<<(i-1))]);
    for(int i=1;i<=q;++i){
        scanf("%d%d",&x,&y);
        int k=lg[y-x+1];
        printf("%d\n",min(mat[k][x],mat[k][y-(1<<k)+1]));
    }
}