#include <bits/stdc++.h>

using namespace std;

ifstream fin ("rmq.in");
ofstream fout ("rmq.out");

int n,m,w[18][100002],lg[100002];

int main()
{
    int a,b;
    fin>>n>>m;
    for(int i=1;i<=n;++i)fin>>w[0][i];
    for(int i=2;i<=n;++i)lg[i]=lg[i/2]+1;
    for(int i=1;(1<<i)<=n;++i)
        for(int j=1;j<=n-(1<<i)+1;++j)
            w[i][j]=min(w[i-1][j],w[i-1][j+(1<<(i-1))]);
    for(int i=1;i<=m;++i){
        fin>>a>>b;
        fout<<min(w[lg[b-a+1]][a],w[lg[b-a+1]][b-(1<<lg[b-a+1])+1])<<'\n';
    }
    return 0;
}