#include <iostream>
#include <fstream>
using namespace std;


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

const int NMAX = 1e5 + 5 ;
const int LMAX = 18;

int a[NMAX], rmq[LMAX][NMAX], lg[NMAX];
int n, m;
inline void preprocess() {
    int l;
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        fin >> a[i];
    for (int i = 2; i <= n; ++i)
        lg[i] = lg[i / 2] + 1;
    for (int i = 1; i <= n; ++i)
        rmq[0][i] = a[i];
    for (int i = 1; (1 << i) <= n; ++i) {
        for (int j = 1; j <= n - (1 << i) + 1; ++j) {
            l = (1 << (i - 1));
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l]);
        }
    }
}

inline void solve() {
    int x, y, diff, sh;
    for (int i = 1; i <= m; ++i) {
        fin >> x >> y;
        diff = y - x + 1;
        int l = lg[diff];
        sh = diff - (1 << l);
        fout << min(rmq[l][x], rmq[l][x + sh]) << " ";
    }
}
int main()
{
    preprocess();
    solve();
    cout << NMAX;
    return 0;
}