#include<iostream>
#include<string>
#include<fstream>
#include<algorithm>
#define nmax 100002
#define lmax 18
using namespace std;
int v[nmax][lmax];
int l[nmax];
int main()
{
    ifstream si;
    si.open("rmq.in");
    ofstream so;
    so.open("rmq.out");
    int n,m;
    si>>n>>m;
    int i;
    for(i=1;i<=n;++i)
        si>>v[i][0];
    l[0]=0;
    l[1]=0;
    for(i=2;i<=n;++i)
        l[i]=l[i/2]+1;
    int j;
    for(j=1;(1<<j)<=n;++j)
        for(i=1;i+(1<<j)-1<=n;++i)
        {
            v[i][j]=min(v[i][j-1],v[i+(1<<(j-1))][j-1]);
        }
    int z,s,d,x,y;
    for(i=0;i<m;++i)
    {
        si>>x>>y;
        d=y-x+1;
        z=l[d];
        s=d-(1<<z);
        so<<min(v[x][z],v[x+s][z])<<endl;
    }
}