#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N], dp[25][N];
ifstream in("rmq.in");
ofstream out("rmq.out");
int log(int x) {
  int ans = 0;
  while(x != 1) {
    ans++;
    x /= 2;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  in >> n >> m;
  for (int i = 1; i <= n; i++) {
    in >> a[i];
  }
  for (int i = 1; i <= n; i++) {
    dp[0][i] = a[i];
  }
  for (int i = 1; (1 << i) <= n; i++) {
    for (int j = 1; j <= n - (1 << i) + 1; j++) {
      dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))]);
    }
  }
  while(m--) {
    int a, b;
    in >> a >> b;
    int len = b - a;
    len = log(len);
    out << min(dp[len][a], dp[len][b - len]) << "\n";
  }
  return 0;
}