#include <fstream>

using namespace std;

ifstream F ("rmq.in");
ofstream G ("rmq.out");

int n, m, rmq[18][100002], lg[100002], x, y, k, dif, k1, k2;

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

    lg[1] = 0;
    for(int i = 2; i <= n; ++ i)
        lg[i] = lg[i / 2] + 1;

    for(int i = 1; (1 << i) <= n; ++ i)
        for(int j = 1; j <= n - (1 << i) + 1; ++ j)
        {
            k = 1 << (i - 1);
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + k]);
        }

    for(int i = 0; i < m; ++ i)
    {
        F >> x >> y;
        dif = y - x + 1;
        k1 = lg[dif];
        k2 = dif - (1 << k1);
        G << min(rmq[k1][x], rmq[k1][x + k2]) << '\n';
    }
    return 0;
}