#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define mp make_pair
#define CHECK(x) if(!(x)) return false;
typedef pair<int, int> pii;

#ifdef INFOARENA
#define ProblemName "rmq"
#endif

#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif

const int MAXN = 100010;
const int MAXLOG = 28;
int dp[MAXLOG][MAXN];
int v[MAXN], N;
int logTable[MAXN];

void prec() {
  for (int i = 0; i < N; ++i)
    dp[0][i] = v[i];
  logTable[0] = logTable[1] = 0;
  for (int l = 1; l < MAXLOG; ++l) {
    for (int i = (1 << l) - 1; i < N; ++i)
      dp[l][i] = min(dp[l - 1][i], dp[l - 1][i - (1 << (l - 1))]);
    for (int i = (1 << l), lim = min(N, (1 << (l + 1))); i <= lim; ++i)
      logTable[i] = l;
  }
}

int query(int l, int r) {
  int lo = logTable[r - l + 1];
  return min(dp[lo][r], dp[lo][l + (1 << lo) - 1]);
}

int main() {
  assert(freopen(InFile, "r", stdin));
  assert(freopen(OuFile, "w", stdout));
  int Q;
  scanf("%d%d", &N, &Q);
  for (int i = 0; i < N; ++i)
    scanf("%d", &v[i]);
  prec();
  while (Q--) {
    int l, r;
    scanf("%d%d", &l, &r);
    --l, --r;
    printf("%d\n", query(l, r));
  }

  /*for (int l = 0; l < N; ++l)
    for (int r = l; r < N; ++r)
      assert(query(l, r) == *min_element(v + l, v + r + 1));*/

  return 0;
}