#include<iostream>
#include<fstream>
#include<algorithm>
#include<bitset>
#include<math.h>
using namespace std;
ofstream so("rmq.out");
int main()
{
    ifstream si;
    si.open("rmq.in");

    int n,m;
    si>>n>>m;
    int a=log2(n)+1;
    int v[n][a],i;
    for(i=0;i<n;++i)
        si>>v[i][0];
    int j;
    for(j=1;j<a;++j)
    {
        for(i=0;i+(1<<j)-1<n;++i)
        {
            v[i][j]=min(v[i][j-1],v[i+(1<<(j-1))][j-1]);
        }
    }
    int b,c,s,p;
    for(i=0;i<m;++i)
    {
        si>>b>>c;
        s=c-b+1;
        a=log2(s);
        --b;
        --c;
        p=s-(1<<a);
        so<<min(v[b][a],v[b+p][a])<<'\n';
    }
}