#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long long n,m,i,j,lg[100005],a[100005],k,x,d[25][100005],y;
int main()
{
    fin>>n>>m;
    lg[1]=0;
    for(i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;

    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=n;i++)
        d[0][i]=a[i];

    for(i=1;i<=lg[n];i++)
        for(j=1;j<=n-(1<<(i-1));j++)
        d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        k=lg[y-x+1];
        fout<<min(d[k][x],d[k][y-(1<<k)+1])<<'\n';
    }
}