#include <fstream>

using namespace std;
int dp[20][100005];
int log2[100005];
int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    for(int i=2;i<=100000;i++)
        log2[i]=log2[i/2]+1;
    int n,m,x,y;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>dp[0][i];
    for(int j=1;j<18;j++)
    {
        for(int i=1;i<=n;i++)
        {
            if((i+(1<<j-1))<=n)
                dp[j][i]=min(dp[j-1][i],dp[j-1][(i+(1<<(j-1)))]);
        }
    }
    for(int i=0;i<m;i++)
    {
        cin>>x>>y;
    int log=log2[y-x+1];
int ans=min(dp[log][x],dp[log][(y+1-(1<<log))]);

cout<<ans<<'\n';
    }
    return 0;
}