#include <fstream>
#include <cmath>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int rmq[20][100005];
int nr_elemente, nr_intervale;

void init_rmq()
{
    int x=log2(nr_elemente);
    for(int i=1; i<=x; i++)
    {
        for(int j=0; j<nr_elemente-(1<<(i-1)); j++)
        {
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
            ///fout<<rmq[i][j]<<' ';
        }
        ///fout<<'\n';
    }
    ///fout<<'\n';
}

void citire()
{
    fin>>nr_elemente>>nr_intervale;
    for(int i=0; i<nr_elemente; i++)
    {
        fin>>rmq[0][i];
        ///fout<<rmq[0][i]<<' ';
    }
    ///fout<<'\n';
}

void solve()
{
    for(int task=1; task <= nr_intervale; task++)
    {
        if(task==8)
        {
            int a;
            a=0;
        }
        int st, dr;
        fin>>st>>dr;
        st--;
        int len=dr-st, ans;
        int loglen=log2(len);
        int left=len-(1<<loglen);
        ans=min(rmq[loglen][st], rmq[loglen][st+left]);
        fout<<ans<<'\n';
    }
}

int main()
{
    citire();
    init_rmq();
    solve();
    return 0;
}