#include <iostream>
#include<fstream>
using namespace std;

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

int main()
{

   int rmq[17][100005];
   int lg[100000];
   lg[1] = 0;

   int n,m;
   fin>>n>>m;
   for(int i=2;i<=n;i++)
   {
      lg[i] = lg[i>>1] +1;
   }

   for(int i=1;i<=n;i++)
      fin>>rmq[0][i];

   for(int i=1;(i<<1) <= n;i++)
      for(int j=1;j<=n-(1<<i)+1;j++)
      {
         int k = 1<<(i-1);
         rmq[i][j] = min(rmq[i-1][j] , rmq[i-1][j+k]);
      }

   for(int i=1;i<=m;i++)
   {
      int a,b;
      fin>>a>>b;
      if(a>b)
         swap(a,b);

      int k = lg[b-a+1];

      fout<<min(rmq[k][a],rmq[k][b-(1<<k)+1])<<'\n';

   }

    return 0;
}