#include <fstream>
#include <cmath>
using namespace std;
int rmq[100001][20],n,m,a[100001],i,j,l,x,y,k,sh;

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]);
    for(i=1; i<=n; i++)
        rmq[i][0]=a[i];
    for(j=1; (1<<j)<=n; j++)
        for(i=1; i+(1<<j)-1<=n; i++)
        {
            l=1<<(j-1);
            rmq[i][j]=min(rmq[i][j-1],rmq[i+l][j-1]);
        }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d", &x, &y);

        l=y-x+1;
        k=log(l);
        sh=l-(1<<k);
        printf("%d\n",min(rmq[x][k],rmq[x+sh][k]) );
    }
    return 0;
}