#include <bits/stdc++.h>

using namespace std;

int n,m,M[100005][20];
int main(){
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    cin>>n>>m;
    for (int i=1;i<=n;i++){
        scanf("%d",&M[i][0]);
    }
    for (int j=1;(1<<j)<=n;++j){
        for (int i=1;i+(1<<(j-1))<=n;i++){
            M[i][j]=min(M[i][j-1],M[i+(1<<(j-1))][j-1]);
        }
    }
    for (int i=1;i<=m;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        int l=log2(b-a+1);
        printf("%d\n",min(M[a][l],M[b-(1<<l)+1][l]));
    }
}