#include <cstdio>
#include <iostream>

using namespace std;

const int SIZE = 1 << 10;

int pointer = SIZE;
char buffer[SIZE];

char Advance() {
  if (pointer == SIZE) {
    fread(buffer, 1, SIZE, stdin);
    pointer = 0;
  }
  return buffer[pointer++];
}

int Read() {
  int answer = 0;
  char ch = Advance();
  while (!isdigit(ch)) {
    ch = Advance();
  }
  while (isdigit(ch)) {
    answer = answer * 10 + ch - '0';
    ch = Advance();
  }
  return answer;
}

const int N = (int) 1e5 + 7;
const int LG = 17;

int n, q;
int a[N][LG];
int logarithm[N];

int main() {
  freopen ("rmq.in", "r", stdin);
  freopen ("rmq.out", "w", stdout);
  n = Read();
  q = Read();
  for (int i = 0; i < n; i++) {
    a[i][0] = Read();
  }
  for (int p = 1; (1 << p) <= n; p++) {
    for (int i = 0; i + (1 << p) - 1 < n; i++) {
      a[i][p] = min(a[i][p - 1], a[i + (1 << (p - 1))][p - 1]);
    }
  }
  for (int i = 2; i <= n; i++) {
    logarithm[i] = 1 + logarithm[i / 2];
  }
  for (int i = 0; i < q; i++) {
    int l = Read(), r = Read();
    l--;
    r--;
    int k = logarithm[r - l + 1];
    cout << min(a[l][k], a[r - (1 << k) + 1][k]) << "\n";
  }
  return 0;
}