#include <bits/stdc++.h>
#define maxN 100005
#define maxLog 19
using namespace std;
int n,m,i,j,l,s,x,y,diff,p;
int v[maxN],lg[maxN];
int rmq[maxLog][maxN];
int main()
{
    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]);
    lg[1]=0;
    for(i=2;i<=n;i++)
        lg[i]=1+lg[i/2];
    for(i=1;i<=n;i++)
        rmq[0][i]=v[i];
    for(i=1;(1<<i)<=n;i++)
        for(j=1;j<=n-(1<<(i-1))+1;j++)
    {
        l=1<<(i-1);
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        diff=y+1-x;
        p=lg[diff];
        s=diff-(1<<p);
        printf("%d\n",min(rmq[p][x],rmq[p][x+s]));
    }
    return 0;
}