#include <cstdio>
#include <algorithm>

using namespace std;

const int NMAX = 1e5+1;
const int MAXLOG = 20;

int rmq[MAXLOG][NMAX];
int logg[NMAX];

int main(){
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i)
      scanf("%d",&rmq[0][i]);

    for(int i=2;i<=n;++i)
      logg[i]=1+logg[i>>1];

    for(int i=1;i<MAXLOG;++i)
      for(int j=1;j+(1<<i-1)<=n;++j)
          rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<i-1)]);

    for(m;m;m--){
        int x,y;
        scanf("%d%d",&x,&y);
        int d=y-x+1;
        d=logg[d];
        printf("%d\n",min(rmq[d][x],rmq[d][y-(1<<d)+1]));
    }
    return 0;
}