#include<stdio.h>
#include<algorithm>
using namespace std;
int lg[100004],a[30][100004],n,m,x,y,i,j,l;
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",&a[i][0]);
    for(i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;

    for(j=1;(1<<j)<=n;j++)
    {
        for(i=1;i+(1<<j)-1<=n;i++)
            a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);

    }
    for(i=1;i<=m;i++)
    {

        scanf("%d%d",&x,&y);
        l=lg[y-x+1];
        printf("%d\n",min(a[x][l],a[y-(1<<l)+1][l]));
    }
    return 0;

}