#include <cstdio>
#include <algorithm>
#define Nmax 100005

using namespace std;

int t[Nmax],dp[Nmax][20],v[Nmax];

inline void PreCalcul()
{
    for(int i=1;i<=100000;++i)
    {
        t[i]=t[i-1];
        if(1<<(t[i]+1)<=i)
            ++t[i];
    }
}

int main()
{
    int N,M,k,i,p,q,j,x,y;
    freopen ("rmq.in","r",stdin);
    freopen ("rmq.out","w",stdout);
    scanf("%d%d", &N,&M);
    for(i=1;i<=N;++i)
        scanf("%d", &v[i]);
    PreCalcul();
    k=t[N];
    for(i=1;i<=N;++i)
        dp[i][0]=v[i];
    for(i=1;i<=N;++i)
        for(j=1;j<=t[i];++j)
            dp[i][j]=min(dp[i][j-1],dp[i-(1<<(j-1))][j-1]);
    while(M--)
    {
        scanf("%d%d", &x,&y);
        q=t[y-x+1];
        p=(1<<q);
        printf("%d\n", min(dp[y][q],dp[x+p-1][q]));
    }
    return 0;
}