#include <cstdio>
#include <algorithm>
#define N 100005
using namespace std;
int n,m,rmq[18][N],lg[N];

int main()
{
    int x,y,i,j;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);

    scanf("%d%d",&n,&m);


    for (i=2;i<=n;++i)
        lg[i]=1+lg[i/2];


    for (i=1;i<=n;++i)
        scanf("%d",&rmq[0][i]);

    for (i=1;1<<i<=n;++i)
        for (j=1;j<=n-(1<<i)+1;++j)
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);

    while (m--)
    {
        scanf("%d%d",&x,&y);

        int k=lg[y-x+1];
        printf("%d\n",min(rmq[k][x],rmq[k][y+1-(1<<k)]));
    }
    return 0;
}