#include<cstdio>
using namespace std;
int minimum(int a,int b){
    if(a<b)
        return a;
    return b;
}
int rmq[100010][20],log[100010],v[100010];
int main(){
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,m,i,j,x,y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++){
        scanf("%d",&v[i]);
        rmq[i][0]=v[i];
    }
    log[1]=0;
    for(i=2;i<=n;i++)
        log[i]=log[i/2]+1;
    for(j=1;(1<<j)<=n;j++)
        for(i=1;i+(1<<j)-1<=n;i++)
            rmq[i][j]=minimum(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
    for(i=1;i<=m;i++){
        scanf("%d%d",&x,&y);
        printf("%d\n",minimum(rmq[x][log[y-x+1]],rmq[y+1-(1<<log[y-x+1])][log[y-x+1]]));
    }
    return 0;
}