#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int v[100003],r[20][100005],log[100005];
int main()
{
    int n,i,j,m;
    cin>>n>>m;
    for(i=1;i<=n;++i)
        cin>>v[i];
    log[1]=0;
    for(i=2;i<=100000;++i)
        log[i]=1+log[i/2];
    for(i=0;i<=log[n]+1;++i)
    {
        for(j=1;j<=n;++j)
        {
            if(i==0)
                r[i][j]=v[j];
            else if (j-(1<<(i-1))>0)
                r[i][j]=min(r[i-1][j],r[i-1][j-(1<<(i-1))]);
        }
    }
    for(i=1;i<=m;++i)
    {
        int a,b;
        cin>>a>>b;
        cout<<min(r[log[b-a+1]][b],r[log[b-a+1]][a+1<<(log[b-a+1])-1])<<'\n';
    }
    return 0;
}