#include <cstdio>
#include<algorithm>
using namespace std;
int x,y,diff,sh,i,j,l,n,m;
int lg[100002];
int rmq[18][100002];
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 ",&rmq[0][i]);
    lg[1]=0;
    for (i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for (i=1;(1<<i)<=n;i++)
        for (j=1;j<=n-(1 << i)+1;j++)
        {
        l=1<<(i-1);
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
        }
    for (i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        diff=y-x+1;
        l=lg[diff];
        sh=diff - (1<<l);
        printf("%d\n",min(rmq[l][x],rmq[l][x+sh]));
    }
    return 0;
}