#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(i=1;i<a;++i)
    {
        for(j=0;j+(1<<i)-1<n;++j)
        {
            v[j][i]=min(v[j][i-1],v[j+(1<<(i-1))][i-1]);
        }
    }
    int b,e,s,minn;
    for(i=0;i<m;++i)
    {
        si>>b>>e;
        s=e-b+1;
        --e;
        --b;
        minn=100000;
        while(e>=b)
        {
            a=log2(s);
            //cout<<s<<' '<<a<<' '<<b<<endl;
            if(minn>v[b][a]);
                minn=v[b][a];
            b=b+(1<<a);
            s=e-b+1;
        }
        so<<minn<<'\n';
    }
}