#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int N=1e5+11;
const int LGMAX=18;
int rmq[N][LGMAX];
int lg[N];
int main()
{
    int n,m,i,j,k,x,y;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>rmq[0][i];
    for(i=2;i<=n;i++)
        lg[i]=lg[(i>>1)]+1;
    for(i=1;(1<<i)<=n;i++)
    {
        k=(1<<(i-1));
        for(j=1;j+(1<<i)-1<=n;j++)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+k]);
    }
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        k=lg[y-x+1];
        fout<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
    }
    return 0;
}