#include <cstdio>
#include <algorithm>
using namespace std;
int n,m,R[18][100005],v[100005],lg[100005];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        R[0][i]=i;
        if (i>1) lg[i]=lg[i>>1]+1;
    }
    for (int i=1;(1<<i)<=n;i++)
    {
        for (int j=1;j<=n-(1<<i)+1;j++)
        {
            int l=1<<(i-1);
            R[i][j]=R[i-1][j];
            if (v[R[i-1][j+l]]<v[R[i][j]])
                R[i][j]=R[i-1][j+l];
        }
    }
    int a,b;
    while (m--)
    {
        scanf("%d %d",&a,&b);
        int diff=b-a+1,l=lg[diff],sh=diff-(1<<l);
        int solInd=R[l][a];
        if (v[R[l][a+sh]]<v[solInd]) solInd=R[l][a+sh];
        printf("%d\n",v[solInd]);
    }
    return 0;
}