#include <bits/stdc++.h>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int nMax = 100003;
int rmq[20][nMax], lg[nMax], a[nMax];
int n, m, x, y;
inline void Solve() {
    for(int i = 1; i <= n; i++) {
        rmq[0][i] = a[i];
    }
    for(int i = 2; i <= n; i++) {
        lg[i] = 1 + lg[i / 2];
    }
    for(int i = 1; (1 << i) <= n; i++) { ///iau fiecare lungime 2 ^ i
        for(int j = 1; j + (1 << i) - 1 <= n; j++) {
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
        }
    }
}
int main()
{
    f >> n >> m;
    for(int i = 1; i <= n; i++) {
        f >> a[i];
    }
    Solve();
    for(int i = 1; i <= m; i++) {
        f >> x >> y;
        int lng = y - x + 1;
        int lnglog = lg[lng];
        g << min(rmq[lnglog][x], rmq[lnglog][y - (1 << lnglog) + 1]) <<"\n";
    }
    return 0;
}