#include<cstdio>
#include<algorithm>
using namespace std;
int dp[100001][20],a[100001],v[100001];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,i,j,m,x,y,k;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(i=1;i<=n;i++)
        dp[i][0]=a[i];
    for(j=1;(1<<j)<=n;j++)
        for(i=1;i<=n-(1<<j)+1;i++)
            dp[i][j]=min(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
    v[1]=0;
    for(i=2;i<=n;i++)
        v[i]=v[i/2]+1;
    for(i=1;i<=m;i++)
        {
        scanf("%d%d",&x,&y);
        k=v[y-x+1];
        printf("%d\n",min(dp[x][k],dp[y-(1<<k)+1][k]));
        }
return 0;
}