#include <fstream>

using namespace std;

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

const int LMAX = 16;
const int NMAX = 100000;

int n, m;
int x, y;

int v[1 + NMAX], log[1 + NMAX];
int rmq[1 + NMAX][1 + LMAX];

int main() {
  cin >> n >> m;
  for(int i = 1; i <= n; i++)
    cin >> v[i];
  log[1] = 0;
  for(int i = 2; i <= n; i++)
    log[i] = log[i / 2] + 1;
  for(int i = 1; i <= n; i++)
    rmq[i][0] = v[i];
  for(int i = 1; (1 << i) <= n; i++) {
    for(int j = 1; j <= n - (1 << i) + 1; j++)
      rmq[j][i] = min(rmq[j][i - 1], rmq[j + (1 << (i - 1))][i - 1]);
  }
  for(int i = 1; i <= m; i++) {
    cin >> x >> y;
    int dif = log[y - x + 1];
    cout << min(rmq[x][dif], rmq[y - (1 << dif) + 1][dif]) << "\n";
  }
  return 0;
}