#include<cstdio>
#include<iostream>
using namespace std;
int n,m,a,b,P[100005]={-1},D[20][100005], x;
int main()
{
    int i,j;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1;i<=n;++i)
    {
        scanf("%d",&D[0][i]);
        P[i]=1+P[i/2];
    }
    for (i=1;i<=P[n]+1;++i){
        int di = (1<<(i-1));
        for (j=1;j<=n;++j) {
            D[i][j]=D[i-1][j];
            if ( j+di <= n &&  D[i][j] > D[i-1][j+di])
                D[i][j] = D[i-1][j+di];
            }
        }
    for (i=1;i<=m;++i)
    {
        scanf("%d%d",&a,&b);
        x = P[b-a+1];
        printf("%d\n",min(D[x][a],D[x][b-(1<<x)+1]));
    }
    return 0;
}