#include <bits/stdc++.h>
using namespace std;
int n,v[100005],lg[100005];
int rmq[100005][20];
void buildrmq()
{
    lg[1]=0;
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(int i=1;i<=n;i++)
        rmq[i][0]=v[i];
    for(int j=1;j<=lg[n];j++)
        for(int i=n-(1<<j)+1;i>=1;i--)
            rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
}
int query(int a,int b)
{
    return min(rmq[a][lg[b-a+1]],rmq[b-(1<<lg[b-a+1])+1][lg[b-a+1]]);
}
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int k,a,b;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>v[i];
    buildrmq();
    for(int i=1;i<=k;i++)
    {
        cin>>a>>b;
        cout<<query(a,b)<<endl;
    }
    return 0;
}