#include <bits/stdc++.h>
using namespace std;
int n,m,v[100005],rmq[25][200005],lo[100005];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    cin>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        cin>>v[i];
        rmq[0][i]=v[i];
    }
    lo[1]=0;
    for(int i=2; i<=n; ++i)
    {
        lo[i]=lo[i/2]+1;
    }
    for(int i=1;i<=lo[n];++i)
    {
        for(int j=1; j<=n; ++j)
        {
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
        }
    }
    for(int i=1; i<=m; ++i)
    {
        int x,y;
        cin>>x>>y;
        int k;
        k=lo[y-x+1];
        cout<<min(rmq[k][x],rmq[k][y-(1<<(k))+1])<<'\n';
    }
    return 0;
}