#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5;
const int MAXLOG = 17;

int rmq[MAXLOG + 1][MAXN + 1], lg[MAXN + 1];

int main()
{
    int n, m;
    ifstream fin("rmq.in");
    fin >> n >> m >> rmq[0][1];
    for (int i = 2; i <= n; ++i) {
      fin >> rmq[0][i];
      lg[i] = lg[i / 2] + 1;
    }
    for (int i = 1; (1 << i) <= n; ++i) {
      int p2 = (1 << i);
      for (int j = 1; j <= n - p2 + 1; ++j)
        rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + p2 / 2]);
    }
    ofstream fout("rmq.out");
    for (int i = 0; i < m; ++i) {
      int a, b;
      fin >> a >> b;
      int diff = lg[b - a + 1];
      fout << min(rmq[diff][a], rmq[diff][b - (1 << diff) + 1]) << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}