#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n,m,i,c,j,p,P,L[100010],V[17][100010],d,x,y;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        scanf("%d",&V[0][i]);
    for(i=1;(1<<i)<=n;i++)
        for(j=1;j+(1<<i)-1<=n;j++)
            V[i][j] = min(V[i-1][j],V[i-1][j+(1<<(i-1))]);
    for(p=2;p<=n;p*=2)
        L[i+1]=1;
    for(i=1;i<=n;i++)
        L[i]+=L[i-1];
    for(;m;m--)
    {
        scanf("%d%d",&x,&y);
        d=L[y-x+1];
        p=1<<d;
        printf("%d\n",min(V[d][x],V[d][y-p+1]));
    }
    return 0;
}