#include <cstdio>
#include <algorithm>

using namespace std;

int logg[100010],rmq[20][100010];

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,m,x,y;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) scanf("%d",&rmq[0][i]);
    for(int i=2;i<=n;i++) logg[i]=logg[i/2]+1;
    for(int l=1;l<=logg[n];l++)
        for(int i=1;i<=n-(1<<l)+1;i++)
            rmq[l][i]=min(rmq[l-1][i],rmq[l-1][i+(1<<(l-1))]);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        int l=logg[y-x+1];
        printf("%d\n",min(rmq[l][x],rmq[l][y-(1<<l)+1]));
    }
    return 0;
}