/**
  *  Worg
  */
#include <cstdio>
#include <algorithm>

FILE *fin = freopen("rmq.in", "r", stdin); FILE *fout = freopen("rmq.out", "w", stdout);

const int MAX_N = 1e5 + 5;
const int MAX_LOG = 18;

/*-------- Data --------*/
int n, m;
int lg2[MAX_N];
int rmq[MAX_LOG][MAX_N];
/*-------- --------*/

void ReadInput() {
  scanf("%d%d", &n, &m);

  for(int i = 1; i <= n; i++) {
    scanf("%d", &rmq[0][i]);
  }
}

void ComputeRmq() {
  for(int i = 1; i < MAX_LOG; i++) {
    int offset = (1 << (i - 1));

    for(int j = 1; j + offset <= n; j++) {
      rmq[i][j] = std::min(rmq[i - 1][j], rmq[i - 1][j + offset]);
    }
  }

  lg2[1] = 0;
  for(int i = 2; i < MAX_N; i++) {
    lg2[i] = lg2[i >> 1] + 1;
  }
}

void ProcessQueries() {
  for(int i = 1; i <= m; i++) {
    int x, y; scanf("%d%d", &x, &y);
    int level = lg2[y - x + 1];

    printf("%d\n", std::min(rmq[level][x], rmq[level][y - (1 << level) + 1]));
  }
}

int main() {
  ReadInput();

  ComputeRmq();

  ProcessQueries();
  return 0;
}