#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 100000;
const int LOGMAX = 16;
int rmq[NMAX + 5][LOGMAX + 5], v[NMAX + 5], lg[NMAX + 5];
int main(){
  freopen("rmq.in", "r", stdin);
  freopen("rmq.out", "w", stdout);
  int n, m, i, j, x, y, l, aux;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i ++){
    scanf("%d", &v[i]);
    rmq[0][i] = v[i];
  }
  for (i = 2; i <= n; i ++)
    lg[i] = lg[i >> 1] + 1;
  for (i = 1; (1 << i) <= n; i ++)
    for (j = 1; j + (1 << i) - 1 <= n; j ++){
      l = 1 << (i - 1);
      rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l]);
    }
  for (i = 1; i <= m; i ++){
    scanf("%d%d", &x, &y);
    l = lg[y - x + 1];
    aux = y - x + 1 - (1 << l);
    printf("%d\n", min(rmq[l][x], rmq[l][x + aux]));
  }
  return 0;
}