#include <fstream>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int dp[18][100001];
int mini(int a,int b)
{
    if(a<=b) return a;
    return b;
}
int lg[100001];
int main()
{
    int n,m,i,a,b,k,j;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>dp[0][i];
    }
    lg[1]=0;
    for(i=2;i<=n;i++) lg[i]=lg[i/2]+1;
    for(i=1;(1<<i)<=n;i++)
    {
        for(j=1;j<=n-(1<<i)+1;j++)
        {
            dp[i][j]=mini(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
        }
    }
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        k=lg[b-a];
        fout<<mini(dp[k][a],dp[k][b-(1<<k)+1])<<"\n";
    }
}