#include <fstream>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

const int nmax = 100005;
int n, m, r[30][nmax], E[nmax];

void BuildRmq()
{
    for(int p = 1; (1<<p) <= n; p ++)
        for(int i = 1; i <= n; i ++)
        {
            r[p][i] = r[p - 1][i];
            int j = i + (1<<(p - 1));
            if(j <= n && r[p - 1][j] < r[p][i])
                r[p][i] = r[p - 1][j];
        }
}

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

    for(int i = 2; i <= n; i ++)
        E[i] = 1 + E[i / 2];
    BuildRmq();

    for(int i = 1; i <= m; i ++)
    {
        int x, y;
        f >> x >> y;
        int len = E[y - x + 1];
        g << min(r[len][x], r[len][y - (1<<len) + 1]) << '\n';
    }
    return 0;
}