#include <fstream>

using namespace std;

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

const int N = 1e5;
int rmq[17][N + 11], logog[N + 11];

int query (int x, int y)
{
    
  int l = logog[y - x + 1];
  return min (rmq[l][y], rmq[l][x + (1 << l) - 1]);
  
}

int main ()
{
    
  int n, m;
  
  fin >> n >> m;
  
  for (int i = 2; i <= N; i++)
    logog[i] = logog[i / 2] + 1;
    
  for (int i = 1; i <= n; i++)
        fin >> rmq[0][i];
        
  for (int j = 1; (1 << j) <= n; j++)
    for (int i = (1 << j); i <= n; i++)
    
      rmq[j][i] = min (rmq[j - 1][i], rmq[j - 1][i - (1 << (j - 1))]);
      
  for (int i = 1; i <= m; i++)
    {
        
        int x, y;
        fin >> x >> y;
        
        fout << query (x, y) << '\n';
    }
  return 0;
}