#include <iostream>
#include <fstream>
#include <cmath>
#define MAXN 100005
#define LOGMAX 20
using namespace std;

int M[MAXN][LOGMAX], v[MAXN];
int n;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
void completare()
{
    for(int i=0;i<n;i++)
        M[i][0]=i;
    for(int j=1; (1<<j)<=n; j++)
        for(int i=0; i+(1<<j)-1 < n; i++)
            if(v[M[i][j-1]]<v[M[i+(1<<(j-1))][j-1]])
                M[i][j]=M[i][j-1];
            else
                M[i][j]=M[i+(1<<(j-1))][j-1];
}
int query(int i, int j)
{
    int k=log2(j-i+1);
    if(v[M[i][k]]<v[M[j-(1<<k)+1][k]])
        return v[M[i][k]];
    return v[M[j-(1<<k)+1][k]];
}
void citire()
{
    int m;
    fin>>n>>m;
    for(int i=0;i<n;i++)
        fin>>v[i];
    int i,j;
    completare();
    for(int q=0;q<m;q++)
    {
        fin>>i>>j;
        fout<<query(i-1,j-1)<<"\n";
    }
}
int main()
{
    citire();
    return 0;
}