#include <fstream>
#include <algorithm>
#include <climits>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");

int n, m, v[100001], dp[17][100001], e[100001], st, dr, val, len;

int putere(int n)
{
    if(n!=1)
        return putere(n/2)+1;
    else return 0;
}

int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>dp[0][i];
    }
    for(int p=1; (1<<p)<=n; p++)
    {
        for(int i=1; i<=n; i++)
        {
            int j=i+(1<<(p-1));
            if(j<=n)
                dp[p][i]=min(dp[p-1][i],dp[p-1][j]);
            else
                dp[p][i]=dp[p-1][i];
        }
    }
    e[1]=0;
    for(int i=2; i<=n; i++)
        e[i]=1+e[i/2];
    for(int i=1; i<=m; i++)
    {
        cin>>st>>dr;
        val=e[dr-st+1];
        len=(1<<val);
        cout<<min(dp[val][st], dp[val][dr-len+1])<<endl;
    }
    return 0;
}