#include <bits/stdc++.h>
#define nmax 1000005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[17][nmax],p[nmax],n,m,v[nmax];
void Formare()
{
    int i;
    p[1]=0;
    for(i=2;i<=n;i++)
        p[i]=p[i/2]+1;
}
void RMQ()
{
    int i,j;
    for(i=1;i<=n;i++)
        rmq[0][i]=v[i];
    for(i=1;(1<<i)<=n;i++)
        for(j=1;j<=n-(1<<i)+1;j++)
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(1-i))]);
}
int main()
{
    int i,lg,k,x,y;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>v[i];
    Formare();
    RMQ();
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        lg=y-x+1;
        k=p[lg];
        fout<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<"\n";
    }
    return 0;
}