#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,q,d[20][100003],st,dr,p[100003];
int main()
{
    cin>>n>>q;
    for(int i=1;i<=n;i++)
        cin>>d[0][i];
    for(int k=1;(1<<k)<=n;k++){
        for(int i=1;i<=n;i++)
            if(i+(k-1)<=n)
                d[k][i]=min(d[k-1][i],d[k-1][i+(1<<(k-1))]);
            else
                d[k][i]=d[k-1][i];
    }
    p[1]=0;
    for(int i=2;i<=n;i++)
        p[i]=p[i/2]+1;
    while(q--){
        cin>>st>>dr;
        int l=dr-st+1;
        cout<<min(d[p[l]][st],d[p[l]][dr-(1<<p[l])+1])<<'\n';
    }
    return 0;
}