#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("rmq.in");
ofstream out ("rmq.out");
int log[100002],r[18][100002];
int main()
{
    int n,m,p,q;
    in>>n>>m;
    for (int i=1;i<=n;i++)
        in>>r[0][i];
    log[1]=0;
    for (int i=2;i<=n;i++)
        log[i]=1+log[i/2];
    for (int i=1;i<=log[n];i++)
        for (int j=1;j<=n-log[i];j++)
            r[i][j]=min(r[i-1][j],r[i-1][j+1<<(i-1)]);
    for (int i=1;i<=m;i++)
    {
        in>>p>>q;
        int l=log[q-p+1];
        out<<min(r[l][p],r[l][q-(1<<l)+1])<<'\n';
    }
    return 0;
}