#include <bits/stdc++.h>
using namespace std;
#define LMAX 100005
int D[20][LMAX],v[LMAX],lg[LMAX];
/// D[i][j]=min(v[j],v[j+1],...v[j+2^i])
int main(){
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,m;
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;++i){
        scanf("%d",&v[i]);
        D[0][i]=v[i];
    }
    lg[1]=0;
    for(int i=2;i<=n;++i)
        lg[i]=lg[i>>1]+1;
    for(int i=1;i<=lg[n];++i)
        for(int j=1;j<=n;++j)
            D[i][j]=min(D[i-1][j],D[i-1][j+(1<<(i-1))]);
    for(int i=1;i<=m;++i){
        int st,dr;
        scanf("%d %d",&st,&dr);
        int k=lg[dr-st];
        printf("%d\n",min(D[k][st],D[k][dr-(1<<k)+1]));
    }
    return 0;
}