#include <fstream>
#include <cmath>

using namespace std;

int t[17][100001];
int v[100001];

int main()
{
    ifstream fin ("rmq.in");
    ofstream fout ("rmq.out");
    int n, m, l, r, niv;

    fin >> n >> m;

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

    for (int i = 1; i <= n; i++)
      t[0][i] = v[i];

    for (int j = 1; n - (1 << j) + 1 > 0; j++)
      for (int i = 1; i <= n - (1 << j) + 1; i++)
        t[j][i] = min(t[j - 1][i], t[j - 1][i + (1 << (j - 1))]);

    for (int i = 0; i < m; i++)
    {
      fin >> l >> r;
      niv = log2(r - l + 1);
      fout << min(t[niv][l], t[niv][r - (1 << niv) + 1]) << '\n';
    }

    return 0;
}