#include <fstream>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,r[20][100005];
int e[100001];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>r[0][i];

    for(int p=1;(1<<p)<=n;p++){
        for(int i=1;i<=n;i++){
            r[p][i]=r[p-1][i];
            int j=i+(1<<(p-1));
            if(j<=n && r[p][i]>r[p-1][j])
                r[p][i]=r[p-1][j];
        }
    }

    e[1]=0;
    for(int i=2;i<=n;i++) ///cea mai mare putere mai mica sau egala decat i
        e[i]=e[i/2]+1;

    int st,dr;
    for(int i=1;i<=m;i++){
        fin>>st>>dr;
        int lg=dr-st+1;
        int exp=e[lg];
        fout<<min(r[exp][st],r[exp][dr-(1<<exp)+1])<<'\n';
    }
    return 0;
}