#include <iostream>
#include <fstream>
#include <iomanip>
#define INF 1000000
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n,k,p;
int T[100001][20];
int m;
int query(int st, int dr)
{
    int rez;
    rez=INF;
    for (int col=k;col>=0;col--)
        if (st+(1<<col)-1<=dr)
        {
            rez=min(rez,T[st][col]);
            st=st+(1<<col);
        }
    return rez;
}

int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++)
        fin>>T[i][0];
    /// etapa I
    /// se construieste T
    k=0;
    p=1;
    while (p*2<=n)
    {
        k++;
        p=p*2;
    }

    for (int col=1;col<=k;col++)
    {
        /// se obtine coloana col din matricea T
        for (int i=1;i<=n-(1<<col)+1;i++)
            T[i][col]=min(T[i][col-1],T[i+(1<<(col-1))][col-1]);
    }


    for (int i=1;i<=m;i++)
    {
        int st,dr;
        fin>>st>>dr;
        fout<<query(st,dr)<<"\n";
    }
    return 0;
}