#include <iostream>
#include <cstdio>
using namespace std;

int n,m,dp[17][100005],x,y,lg[100005];

void citire()
{
    scanf("%d%d",&n,&m);
    for (int i=1; i<=n; ++i)
        scanf("%d",&dp[0][i]);

}
void constr()
{
    lg[1]=0;
    for (int i=2;i<=n;++i)
        lg[i]=lg[i/2]+1;
    for (int i=1; (1<<i)<=n ; ++i)

        for (int j=1; j<= n - (1<<i)+1; ++j)

            dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]); ///construiesc matricea


}
void solve()
{
    constr();
    for (int i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        int k=lg[y-x+1];
        printf("%d\n",min(dp[k][x],dp[k][y-(1<<k)+1]));
    }
}
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    citire();
    solve();

    return 0;
}