#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define NMAX 100008
#define LMAX 25
#define inf 0x3f3f3f3f

using namespace std;

int n, m, a[NMAX], best[NMAX][LMAX], sqr;

void preCalc()
{
   for (int i = 1; i <= n; ++i){
      memset(best[i], inf, sizeof(best[i]));
      best[i][0] = a[i];
   }
   for (int i = 1; i <= n; ++i){
      for (int j = 1; j*j <= n; ++j){
         best[i][j] = min(best[i][j-1], a[i+j]);
      }
   }
   for (int j = 1; j*j <= n; ++j, ++sqr);
}

int main()
{
   freopen("rmq.in", "r", stdin);
   freopen("rmq.out", "w", stdout);
   scanf("%d %d\n", &n, &m);
   for (int i = 1; i <= n; ++i)
      scanf("%d\n", &a[i]);
   preCalc();
   int mini, x, y, dif;
   for (int i = 1; i <= m; ++i){
      mini = inf;
      scanf("%d %d\n", &x, &y);
      dif = y - x;
      while (dif > sqr){
         mini = min(mini, best[x][sqr]);
         x += sqr;
         dif -= sqr;
      }
      mini = min(mini, best[x][dif]);

      printf("%d\n", mini);
   }

   return 0;
}