#include <fstream>
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 100000;
const int LOGN = 17;
int a[LOGN][NMAX];
int bilog[NMAX];
int main()
{
    ifstream in("rmq.in");
    ofstream out("rmq.out");
    int n, m;
    in >> n >> m;
    bilog[1] = 0;
    for(int i = 2; i <= n; i++)
      bilog[i] = 1 + bilog[i / 2];

    for(int i = 0; i < n; i++){
      in >> a[0][i];
    }
    for(int i = 1; i <= LOGN; i++){
      for(int j = 0; j + (1 << i) - 1 < n; j++){
        a[i][j] = min( a[i - 1][j], a[i - 1][j + ( 1 << (i - 1))]);
      }
    }
    int l, r;
    for(int i = 0; i < m; i++){
      in >> l >> r;
      l--;r--; // ca sa inceapa de la 0
      int p = bilog[ r - l + 1];
      out << min( a[p][l], a[p][r - (1 << p) + 1]) << '\n';
    }
    return 0;
}