#include <bits/stdc++.h>

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