#include <bits/stdc++.h>
#define nmax 100003
using namespace std;

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

int v[nmax], lg[nmax], mat[nmax][18], n, i, m;

void lg_find()
{
  lg[1] = 0;
  for(i = 2; i <= nmax; i++)
    lg[i] = lg[i>>1] + 1;
}

void fill_v()
{
  for(i = 1; i <= n; i++)
    fin >> v[i], mat[i][1] = i;
}

void rmq()
{
  int j, k;
  k = lg[n];
  for(j = 1; j <= k; j++)
  {
    for(i = 1; i + (1<<j) - 1 <= n; i++)
    {
      if(v[mat[i][j]] < v[mat[i + (1<<(j-1))][j]])
        mat[i][j+1] = mat[i][j];
      else
        mat[i][j+1] = mat[i + (1<<(j-1))][j];
    }
  }
}

void answer_questions()
{
  int a, b, k, y;
  for(i = 0; i < m; i++)
  {
    fin >> a >> b;
    k = lg[b-a+1];
    y = b - (1<<(k)) + 1;
    if(v[mat[a][k+1]] < v[mat[y][k+1]])
      fout << v[mat[a][k+1]];
    else
      fout << v[mat[y][k+1]];
    fout << '\n';
  }
}

int main()
{
    lg_find();
    fin >> n >> m;
    fill_v();
    rmq();
    answer_questions();
    return 0;
}