# include <cstdio>
# include <algorithm>
# define N 100001
# define I (1<<i)
# define K (1<<k)
# define L 20

using namespace std;

int n,m,k,x,y,i,j;
int lg[N],a[N];
int d[L][N];

void log2()
{
    int i;
    lg[1]=0;
    for(i=2; i<=n; ++i)
        lg[i]=lg[i/2]+1;
    return;
}

int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    scanf("%d %d\n", &n, &m);
    log2();
    for(i=1; i<=n; ++i)
        scanf("%d\n", &a[i]);
    for(i=1; i<=n; ++i)
        d[0][i]=a[i];
    for(i=1; I<=n; ++i)
        for(j=1; j<=n-I+1; ++j)
            d[i][j]=min(d[i-1][j],d[i-1][j+I/2]);
    for(i=1; i<=m; ++i)
    {
        scanf("%d %d\n", &x, &y);
        k=lg[y-x+1];
        printf("%d\n", min(d[k][x],d[k][y-K+1]));
    }
}