#include <bits/stdc++.h>

using namespace std;

class IndexVec
{
public:
int elem;
int indx;





};

ifstream fin("rmq.in");
ofstream fout("rmq.out");

IndexVec vec[1000];
int i, j, nr_elem, nr_que;

bool sortf(const IndexVec &a, const IndexVec &b);

int main()
{
  fin >> nr_elem >> nr_que;
  for (i=1; i<=nr_elem; i++)
   fin >> vec[i].elem, vec[i].indx = i;

  sort(vec+1, vec+nr_elem+1, sortf);


  int st, dr;
  for (i=1; i<=nr_que; i++)
   {
     fin >> st >> dr;
     for (j=1; j<=nr_elem; j++)
      if (vec[j].indx==st || vec[j].indx==dr)
       {
         fout << vec[j].elem << "\n";
         break;
       }
   }

  return 0;
}

bool sortf(const IndexVec &a, const IndexVec &b)
{
return (a.elem<b.elem);
}