#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n, m, i, v[100001], st, dr, minim, j;

int main()
{
  f >> n >> m;
   for (i=1; i<=n; i++)
     f >> v[i];
   for(i=1; i<=m; i++)
   {
       f >> st >> dr;
       sort(v+st,v+dr+1);
       g << v[st] << '\n';
   }
    return 0;
}