#include <bits/stdc++.h>

using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");

const int lg = 19;
const int max_n = (int)1e5 + 5;

int n, m;

int v[max_n];

int rmq[lg][max_n];

int lgs[max_n];

int main() {
  in >> n >> m;
  for (int i = 1; i <= n; i++) {
    in >> v[i];
  }
  for (int i = 1; i <= n; i++) {
    rmq[0][i] = v[i];
  }
  for (int l = 1; (1 << l) <= n; l++) {
    for (int i = 1; i <= n - (1 << l) + 1; i++) {
      int pw = (1 << (l - 1));
      rmq[l][i] = min(rmq[l - 1][i], rmq[l - 1][i + pw]);
    }
  }
  for (int i = 2; i <= n; i++) {
    lgs[i] = lgs[i / 2] + 1;
  }
  for (int i = 1; i <= m; i++) {
    int x, y;
    in >> x >> y;
    int l = lgs[y - x + 1];
    out << min(rmq[l][x], rmq[l][y - (1 << l) + 1]) << "\n";
  }
  return 0;
}