///implementare mai frumoasa
#include <bits/stdc++.h>
using namespace std;
int n,m,i,j,a[20][100010],Log[100010],k,l,r,A,B,aux,d;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    cin>>n>>m;
    for(i=1; i<=n; ++i)
        cin>>a[0][i];
    for(i=2; i<=n; ++i)
        Log[i]=Log[i/2]+1;
    for(i=1; i<=Log[n]; ++i)
        for(j=1; j<=n; ++j)
        {
            aux=(1<<(i-1));
            A=a[i-1][j];
            B=a[i-1][j-aux];
            a[i][j]=min(A,B);
        }
    ++m;
    while(--m)
    {
        cin>>l>>r;
        d=r-l+1;
        aux=d-(1<<Log[d]);
        A=a[Log[d]][r];
        B=a[Log[d]][r-aux];
        cout<<min(A,B)<<'\n';
    }
    return 0;
}