#include <fstream>
#define maxn 100001
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int r[20][maxn],n,i,m,x,y,e[maxn];
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>r[0][i];
    for(int p=1;(1<<p)<=n;p++)
        for(i=1;i<=n;i++)
        {
            r[p][i]=r[p-1][i];
            int j=i+(1<<(p-1));
            if(j<=n&&r[p][i]>r[p-1][j])
                r[p][i]=r[p-1][j];
        }
    e[1]=0;
    for(i=2;i<=n;i++)
        e[i]=1+e[i/2];
    while(m--)
    {
        fin>>x>>y;
        int exp=e[y-x+1];
        int len=(1<<exp);
        fout<<min(r[exp][x],r[exp][y-len+1])<<'\n';
    }
    return 0;
}