#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");

#define lmax 17
#define nmax 100010

int n,m,a[nmax][lmax],t,lg[nmax],x,y,l,dr,p;

int main()
{
    int i,j;
    cin>>n>>m;
    for (i=1;i<=n;i++)
        cin>>a[i][0];
    for (j=1;(1<<j)<=n;j++)
    {
        p=1<<(j-1);
        for (i=1;i+(1<<j)-1<=n;i++)
            a[i][j]=min(a[i][j-1],a[i+p][j-1]);
    }

    for (i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for (i=1;i<=m;i++)
    {
        cin>>x>>y;
        l=y-x+1;
        t=lg[l];
        dr=l-(1<<t);
        cout<<min(a[x][t],a[x+dr][t])<<'\n';
    }
}