#include <iostream>
#include <cstdio>
#define nmax 100002;
using namespace std;

int n,m,rmq[17][100002];
int lg[100002];

void solve()
{
    for (int i=2;i<=100000;++i)
        lg[i]=lg[1>>(i)]+1;
    for (int i=1;(1<<i)<=n;++i)
        for (int j=1;j<=n-(1<<i)+1;j++)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}

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