#include <fstream>
#include <cmath>
#define NMAX 100000

using namespace std;

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

int M[NMAX][17], A[NMAX];

int main()
{
  int n, m, x, y, k;

  fin >> n >> m;
  for (int i = 0; i < n; i++)
    fin >> A[i];

  for (int i = 0; i < n; i++)
    M[i][0] = A[i];
  for (int j = 1; (1 << j) < n; j++)
    for (int i = 0; i + (1 << j) - 1 < n; i++)
      M[i][j] = min(M[i][j - 1], M[i + (1 << (j - 1))][j - 1]);

 for (int i = 1; i <= m; i++)
 {
   fin >> x >> y;
   x--;
   y--;
   k = log2(y - x + 1);
   fout << min(M[x][k], M[y - (1 << k) + 1][k]) << '\n';
 }

  fin.close();
  fout.close();

  return 0;
}