#include <cstdio>

using namespace std;
int i,n,m,l[100004],a[20][100004],x,y,j;
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[0][i]);
    for (i=2;i<=n;i++)
        l[i]=l[i/2]+1;
    for (i=1;(1<<i)<=n;i++)
        for (j=1;j<=(n-(1<<i)+1);j++)
        {
            if (a[i-1][j]<a[i-1][j+(1<<(i-1))])
                a[i][j]=a[i-1][j];
            else
                a[i][j]=a[i-1][j+(1<<(i-1))];
        }
    for (i=1;i<=m;i++)
    {
        scanf ("%d %d", &x, &y);
        if (a[l[y-x+1]][x]<a[l[y-x+1]][y-(1<<l[y-x+1])+1])
            printf ("%d\n", a[l[y-x+1]][x]);
        else
            printf ("%d\n", a[l[y-x+1]][y-(1<<l[y-x+1])+1]);
    }
    return 0;
}