#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;

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

int main(void) {
  // freopen("rmq.in", "r", stdin);
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  int N, M;
  fin >> N >> M;
  vi v(N), lg(N+1);
  rep(i, N) { fin >> v[i]; }

  lg[1] = 0;
  for (int n = 2; n < N+1; ++n)
    lg[n] = lg[n/2] + 1;

  vector<vi> rmq(lg[N]+1, vi(N));
  rep(i, N) { rmq[0][i] = v[i]; }

  for(int i = 1; i <= lg[N]; ++i) {
    for(int j = 0; j + (1 << i) - 1 < N; ++j) {
      rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1<<(i-1))]);
    }
  }

  int x, y;
  rep(m, M) {
    fin >> x >> y;
    -- x, --y;
    int diff = y - x + 1;
    int l = lg[diff];
    fout << min(rmq[l][x], rmq[l][y-(1<<l)+1]) << '\n';
  }

  return 0;
}