#include <iostream>
#include  <fstream>

using namespace std;

ifstream be("rmq.in");
ofstream ki("rmq.out");

#define nmax 100002
#define lmax 18

int rmq[lmax][nmax],a[nmax],lg[nmax];
int n,m;

void log()
{
    lg[1]=0;
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
}

void solve()
{
    log();
    for (int i=1;i<=n;i++)
        rmq[0][i]=a[i];
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j+(1<<i)-1<=n;j++)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    int x,y;
    for(int i=1;i<=m;i++)
    {
        be>>x>>y;
        int hossz=y-x+1;
        int logaritmus=lg[hossz];
        int d=hossz -(1<<logaritmus);
        ki<<min(rmq[logaritmus][x],rmq[logaritmus][x+d])<<"\n";

    }
}

int main()
{
    be>>n>>m;
    for(int i=1;i<=n;i++)
        be>>a[i];
    solve();
    return 0;
}