#include <stdio.h>
#define fr(i,a,b) for(int i=a;i<b;++i)
#define N 100000
#define LOGN 20
#define min(a,b) (a<b)?a:b
int a[LOGN][N];
int log[N+1];
int log2[N+1];
int main(){
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,m,x,y;
    scanf("%i%i",&n,&m);
    int l=1,lg=0;
    fr(i,1,n+1){
        if(i>=2*l) {l*=2;++lg;}
        log[i]=lg;
        log2[i]=l;
        }
    fr(i,0,n)scanf("%i",a[0]+i);
    l=1;
    fr(i,1,log[n]+1){
        fr(j,0,n) a[i][j]=(j+l<n)?min(a[i-1][j],a[i-1][j+l]):a[i-1][j];
        l*=2;
        }
    fr(i,0,m){
        scanf("%i%i",&x,&y);
        l=log[y-x];
        lg=log2[y-x];
        printf("%i\n",min(a[l][x-1],a[l][y-lg-1]));
        }
    return 0;
    }