#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

#define nmax 100010

int RMQ[nmax][20], N, M, v[nmax], X, Y;


void RangeMinimumQuery()
{
     int i, j;
     for(i = 0; i < N; i++) RMQ[i][0] = i;
     for(j = 1; (1 << j) <= N; j++)
           for(i = 0; i + (1 << j) - 1 < N; i++)
                 if(v[RMQ[i][j - 1]] < v[RMQ[i + (1 << (j - 1))][j - 1]])
                               RMQ[i][j] = RMQ[i][j - 1];
                 else 
                      RMQ[i][j] = RMQ[i + (1 << (j - 1))][j - 1];
}

int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    int i;
    scanf("%i %i", &N, &M);
    for(i = 0; i < N; i++) scanf("%i", &v[i]);
    RangeMinimumQuery();
    for(; M; M --)
    {
          scanf("%i %i", &X, &Y);
          X --, Y --;
          int k = (int) log2(Y - X + 1);
          if(v[ RMQ[X][k] ] <= v[ RMQ[Y - (1 << k) + 1][k] ]) printf("%i\n", v[ RMQ[X][k] ]);
          else printf("%i\n", v[ RMQ[Y - (1 << k) + 1][k] ]);
    }
    return 0;
}