#include <cstdio>
#include <algorithm>

using namespace std;

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

int query(int x,int y)
{
    int k=logg[y-x+1];
    return min(rmq[x][k],rmq[y-(1<<k)+1][k]);
}


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[i][0]);
    for(int i=2;i<=n;i++) logg[i]=logg[i/2]+1;
    for(int i=1;i<=logg[n];i++)
    {
        int lim=n-(1<<i)+1;
        for(int j=1;j<=lim;j++)
            rmq[j][i]=min(rmq[j][i-1],rmq[j+(1<<(i-1))][i-1]);
    }
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        printf("%d\n",query(x,y));
    }
    return 0;
}