#include <bits/stdc++.h>
 
using namespace std;
 
ifstream f("rmq.in");
ofstream g("rmq.out");

int n, q, x, a, b, rmq[20][100005];

int main()
{
    f >> n >> q;
    for (int i = 1; i <= n; ++i)
        f >> rmq[0][i];

    for (int p = 1; (1 << p) <= n; ++p)
        for (int i = (1 << p); i <= n; ++i)
            rmq[p][i] = min(rmq[p - 1][i], rmq[p - 1][i - (1 << (p - 1))]);

    while (q--)
    {
        f >> a >> b;
        int lg = log2(b - a);
        g << min(rmq[lg][a + (1 << lg) - 1], rmq[lg][b]) << '\n';
    }

    return 0;
}