#include <cstdio>
#include <algorithm>
#define nmax 100009
using namespace std;
int v[nmax];
int d[nmax][40];
int minim(int a,int b)
{
    if(a==0)
        return b;
    if(b==0)
        return a;
    if(a<b)
        return a;
    return b;
}
int main()
{
    int i,j,n,m,x,y,log;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d",&n);scanf("%d",&m);
    for(i=1;i<=n;i++)
        scanf("%d",&v[i]);
    for(i=1;i<=n;i++)
        d[i][0]=v[i];
    i=0;
    for(j=1;(1<<j)<=n;j++)
        for(i=1;i<=n-(1<<j)+1;i++)
            if(d[i+(1<<(j-1))][j-1]<d[i][j-1])
                d[i][j]=d[i+(1<<(j-1))][j-1];
            else
                d[i][j]=d[i][j-1];
    for(i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        int k=0;
        int l=1;
        while(l<(y-x+1))
        {
            k++;
            l=l*2;
        }
        printf("%d\n",minim(d[x][k-1],d[y-(1<<(k-1))+1][k-1]));
    }

    return 0;
}