#include <iostream>
#include <fstream>
#define infinit 999999999
using namespace std;

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

int v[100010], log[100010];
int dp[400010][22];
int n, m;

int minim(int a, int b)
{
  if(a < b)
    return a;
  return b;
}
int t = 0;
int interogare(int x, int y)
{
    t++;
    if(x == y)
      return v[x];
    else
    {

      int dif;
      dif = y - x ;
    //  g << "A " << t << "-lea querri " << endl << x <<" " << log[dif] << " " << dp[x][log[dif]] << endl << y-(1<<log[dif]) << " " << log[dif] << " " << dp[y-(1<<log[dif])][log[dif]] << endl;
      return minim(dp[x][log[dif]], dp[y-(1<<log[dif])][log[dif]]);
    }
}

int main()
{
  f >> n;
  f >> m;
  int i, j, x , y;
  for(i = 1; i <= n; i++)
    f >> v[i];
  for(i = 0; i < 100010; i++)
    for(j = 0; j < 16; j++)
      dp[i][j] = infinit;
  for(i = 1; i <= n; i++)
    dp[i][0] = minim(v[i], v[i+1]);
  dp[n][0] = v[n];
  ///precalculare log
  j = 0;
  for(i = 2; i <= n; i++)
  {
    log[i] = log[i/2] + 1;
  }
  for(j = 1; j <= log[n]; j++)
  {
    for(i = 1;(i + (1 << (j-1))) <= n ; i++)
    {

      dp[i][j] = minim(dp[i][j-1], dp[i  + (1 << (j-1))][j-1]);
    }
  }
  for(i = 0 ; i < m ; i++)
  {
    f >> x >> y;
    g << interogare(x, y) << '\n';
  }
}