#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[17][100005],a[100005],n,m,putere[100005];
void Formare()
{
    int i;
    putere[1]=0;
    /// p[i]=k,2^k<=n(k cel mai mare)
    for(i=2;i<=n;i++)
        putere[i]=putere[i/2]+1;
}
void Rmq()
{
    int i,j;
    for(i=0;i<=n;i++)
        rmq[0][i]=a[i];
    /// numarul minim din secv:[j....j+2^i+1]
    for(i=1;(1<<i)<=n;i++)
        for(j=1;j<=n-(1<<i)+1;j++)
         rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
int main()
{
    int i,x,y,L,k;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>a[i];
    Formare();
    Rmq();
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        L=y-x+1; ///Lungimea secventei
        k=putere[L];
        fout<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<"\n";
    }
    return 0;
}