#include <cstdio>
#include <algorithm>

using namespace std;

int v[100001],r[100001][17],log1[100001];

int main()
{
    FILE *fin,*fout;
    int n,q,i,j,l,a,b,m;
    fin=fopen("rmq.in","r");
    fout=fopen("rmq.out","w");
    fscanf(fin,"%d%d", &n, &m);
    for (i=1;i<=n;i++)
        fscanf(fin,"%d", &v[i]);
    for (i=1;i<=n;i++) {
        r[i][0]=v[i];
        for (j=1;(1<<j)<=i;j++)
            r[i][j]=min(r[i-(1<<(j-1))][j-1],r[i][j-1]);
    }
    log1[1]=0;
    for (i=2;i<=n;i++)
        log1[i]=1+log1[i/2];
    for (i=1;i<=m;i++) {
        fscanf(fin,"%d%d", &a, &b);
        l=log1[b-a+1];
        q=min(r[a+(1<<l)-1][l],r[b][l]);
        fprintf(fout,"%d\n", q);
    }
    return 0;
}