#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5+2;
const int LMAX = 18;
int n,q,a[NMAX],rmq[LMAX][NMAX];

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

int main() {
  fin >> n >> q;
  for(int i = 1; i <= n; i++){
    fin >> a[i];
    rmq[0][i] = a[i];
  }
  for(int i = 1; i < LMAX; i++){
    for(int j = 1; j+(1<<i)-1 <= n; j++){
      rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
    }
  }
  while(q--){
    int l, r;
    fin >> l >> r;
    int len = r-l+1;
    int lg = __lg(len);
    fout << min(rmq[lg][l], rmq[lg][r-(1<<lg)+1]) << "\n";
  }
  return 0;
}