#include <bits/stdc++.h>

using namespace std;
const int nmax=100005;
int lg[nmax],rmq[nmax][20],n,v[nmax],m,a,b;
void buildrmq()
{
    lg[1]=0;
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(int i=1;i<=n;i++)
        rmq[i][0]=v[i];
    for(int j=1;j<=lg[n];j++)
        for(int i=1;i<=n-(1<<j)+1;i++)
            rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
}
int answerrmq(int x,int y)
{
    return min(rmq[x][lg[y-x+1]],rmq[y-(1<<(lg[y-x+1]))+1][lg[y-x+1]]);
}
int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>v[i];
    buildrmq();
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b;
        cout<<answerrmq(a,b)<<"\n";
    }
    return 0;
}