#include <fstream>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int dp[17][100010],lg2[100010];
int main()
{
    int n,m,i,j;
    fin>>n>>m;
    for(i=1;i<=n;i++) fin>>dp[0][i];
    for(i=2;i<=n;i++) lg2[i]=lg2[i/2]+1;
    for(i=1;(1<<i)<=n;i++)
    {
        for(j=1;j<=n-(1<<i)+1;j++)
        {
            dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
        }
    }
    while(m--)
    {
        fin>>i>>j;
        int k=lg2[j-i];
        fout<<min(dp[k][i],dp[k][j-(1<<k)+1])<<"\n";
    }
}