#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g ("rmq.out");
int n,m;
int v[100001];
int dp[100005][31];
void init()
{
    for(int i = 1;i<=n;i++)
    {
        dp[i][0] = i;
    }
}
void citire()
{
    f >> n >> m;
    for(int i = 1;i<=n;i++)
    {
        f >> v[i];
    }
}
void calc()
{
    int mx = log2(n)+1;
    for(int putere = 1;putere<=mx;putere++)
    {
        for(int inceput =1;inceput<=n-(1<<putere)+1;inceput++)
        {
            if(v[dp[inceput][putere-1]]<v[dp[inceput+(1<<(putere-1))][putere-1]])
            {
                dp[inceput][putere] = dp[inceput][putere-1];
            }
            else
                dp[inceput][putere] = dp[inceput+(1<<(putere-1))][putere-1];
        }
    }
}
int query(int s,int fin)
{
    int l = log2(fin-s+1);
    return min(v[dp[s][l]],v[dp[fin-(1<<(l))+1][l]]);
}
int main()
{
    citire();
    init();
    calc();
    for(int i = 1;i<=m;i++)
    {
        int s,fin;
        f >> s >> fin;
        g << query(s,fin)<< endl;
    }
}