#include <iostream>
#include <fstream>
std::ifstream in("rmq.in");
std::ofstream out("rmq.out");

using namespace std;
int n,dp[20][100005],lg[100005],k,t,norm,a,b;

int main()
{
    in>>n>>t;
    for(int i=1;i<=n;i++)
        in>>dp[0][i];
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(int i=1;i<=18;i++)
    {
        k=1<<i;
        for(int j=1;j+k-1<=n;j++)
        {
            dp[i][j]=min(dp[i-1][j],dp[i-1][j+k/2]);
        }
    }
    for(int i=0;i<t;i++)
    {
        in>>a>>b;
        norm=lg[b-a];
        out<<min(dp[norm][a],dp[norm][b-(1<<norm)+1])<<"\n";
    }
    return 0;
}