#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,m,rmq[30][100001],E[100001];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;++i) cin>>rmq[0][i];
    /// implementez RMQ-UL
    for(int p=1;(1<<p)<=n;++p)
        for(int i=1;i<=n;++i){
            int aux=i+(1<<(p-1));
            if(aux<=n) rmq[p][i]=min(rmq[p-1][i],rmq[p-1][aux]);
            else rmq[p][i]=rmq[p-1][i];
        }
    /// Cea mai apropiata putere de a lui 2
    E[1]=0;
    for(int i=2;i<=n;++i) E[i]=1+E[i/2];
    while(m--){

        int s,d;
        int len=(1<<E[d-s+1]);
        cout<<min(rmq[E[d-s+1]][s],rmq[E[d-s+1]][d-len+1])<<'\n';
    }

}