#include <cstdio>
#include <algorithm>
#define MAX 20
#define MAXX 100010
using namespace std;
int mat[MAX][MAX];
int v[MAXX],n,m,lg[MAXX];
int main()
{
    int i,j,lung;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)scanf("%d",v+i);
    lg[1]=0;
    for (i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(i=1;i<=n;++i)mat[0][i]=v[i];
    for(i=1;(1<<i)<=n;++i)
        for(j=1;j<=n-(1<<i)+1;++j){
            lung=1<<(i-1);
            mat[i][j]=min(mat[i-1][j],mat[i-1][j+lung]);
        }
    int dif,x,y,second;
    for(i=1;i<=m;++i){
        scanf("%d%d",&x,&y);
        dif=y-x+1;
        lung=lg[dif];
        second=dif-(1<<lung);
        printf("%d\n",min(mat[lung][x],mat[lung][x+second]));
    }
    return 0;
}