#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m;
int dp[20][100009];
int putere_max_de2(int x)
{
    int nr=0;
    while((1<<nr)<=x)
    {
        nr++;
    }
    nr--;
    return nr;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        fin>>dp[0][i];
    }
    int nputere=putere_max_de2(n);
    nputere++;
    for(int i=1;i<=nputere;i++)
    {
        for(int j=1;j<=n;j++)
        {
            dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
        }
    }
    for(int i=1;i<=m;i++)
    {
        int a, b;
        fin>>a>>b;
        int putere=putere_max_de2(b-a+1);
        //cout<<putere<<endl;
        int val_putere=(1<<putere);
        fout<<min(dp[putere][a],dp[putere][b-val_putere+1])<<'\n';
        //cout<<i<<endl;
    }
    return 0;
}