#include <iostream>
#include <fstream>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int MaxN = 100005;
int n, m, rm[20][MaxN], v[MaxN], lg[MaxN];

int main()
{
    f >> n >> m;
    lg[1] = 0;
    for (int i = 2; i <= n; i++) lg[i] = lg[i / 2] + 1;
    for (int i = 1; i <= n; i++) f >> v[i];
    for (int i = 1; i <= n; i++) rm[0][i] = v[i];
    for (int pas = 1; (1 << pas) <= n; pas++)
        for (int i = 1; i <= n; i++)
            rm[pas][i] = min(rm[pas - 1][i], rm[pas - 1][min(n, i + (1 << (pas - 1)))]);
    for (; m; --m)
    {
        int x, y, l;
        f >> x >> y;
        l = y - x + 1;
        int pas = lg[l];
        g << min(rm[pas][x], rm[pas][y - (1 << pas) + 1]) << '\n';
    }
    return 0;
}