#include <fstream>
using namespace std;
ifstream in ("rmq.in");
ofstream out ("rmq.out");
long long n, m, x, y, rmq[18][100001], lg[100001], a[100001];
int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; i++)
        in >> 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++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+1]);
    for (int i = 1; i <= m; i++)
    {
        in >> x >> y;
        int dif = y - x + 1, l = lg[dif], sh = dif - (1 << l);
        out << min(rmq[l][x], rmq[l][x+sh]) << '\n';
    }
    out.close(); return 0;
}