#include <bits/stdc++.h>

using namespace std;

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

int n, m, rmq[22][100002], a, x, y;

int main()
{
  fin >> n >> m;
  for (int i = 1; i <= n; i++) {
    fin >> a;
    rmq[0][i] = a;
  }
  for (int i = 1; (1 << i) <= n; i++) {
    int nr = (1 << i);
    for (int j = 1; j <= n - nr + 1; j++)
      rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (nr >> 1)]);
  }
  for (int i = 1; i <= m; i++) {
    fin >> x >> y;
    int k = log2(y - x + 1);
    fout << min(rmq[k][x], rmq[k][y - (1 << k) + 1]) << "\n";
  }
  return 0;
}