#include <fstream>

using namespace std;

int n,m,a[100005],log[100005],dp[100005][18];
int main(){
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    for (int i=2;i<=n;i++){
        log[i]=1+log[i/2];
    }
    for (int i=1;i<=n;i++){
        dp[i][0]=a[i];
    }
    for (int i=1;i<=n;i++){
        for (int j=1;(1<<j)<=i;j++){
            dp[i][j]=min(dp[i][j-1],dp[i-(1<<(j-1))][j-1]);
        }
    }
    for (int i=1;i<=m;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        int nr=b-a+1;
        printf("%d\n",min(dp[b][log[nr]],dp[a+(1<<log[nr])-1][log[nr]]));
    }
}