#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,i,q,st,dr,d[100005][20],j,e;
int main()
{
    fin>>n>>q;
    for(i=1;i<=n;i++) fin>>d[i][0];
    for(j=1;(1<<j)<=n;j++)
        for(i=1;i+(1<<j)-1<=n;i++)
            d[i][j]=min(d[i][j-1],d[i+(1<<j)/2][j-1]);

    for(i=1;i<=q;i++)
    {
        fin>>st>>dr;
        int l=dr-st+1;
        int p=1;
        e=0;
        while(2*p<=l)
        {p*=2;
         e++;
        }
        fout<<min(d[st][e],d[dr-p+1][e])<<'\n';
    }
    return 0;
}