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

#define MAXN 100010
#define MAXLGN 18

int main(){

  freopen("rmq.in", "r", stdin);
  freopen("rmq.out", "w", stdout);

  int N, M, lg[MAXN], i, j, k, A[MAXN], a, b;
  static int RMQ[MAXN][MAXLGN];

  scanf("%d%d", &N, &M);
  for(i=1; i<=N; i++)
    scanf("%d", A+i);

  lg[1]=0;
  for(i=2; i<=N; i++)
    lg[i]=lg[i/2]+1;
  
  for(i=1; i<=N; i++)
    RMQ[i][0]=A[i];
  
  for(i=1; (1<<i)<=N; i++)
    for(j=1; j+(1<<i)-1 <= N; j++)
      RMQ[j][i]=min(RMQ[j][i-1], RMQ[j+(1<<(i-1))][i-1]);

  for(i=1; i<=M; i++){
    scanf("%d%d", &a, &b);
    k=lg[b-a+1];
    printf("%d\n", min(RMQ[a][k], RMQ[b-(1<<k)+1][k]));
  }

  return 0;

}