#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int maxn = 100005;
int rmq[17][maxn];
int lg2[maxn];
int v[maxn];
int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 2; i <= n; i++)
        lg2[i] = lg2[i / 2] + 1;
    for(int i = 1; i <= n; i++)
        in >> rmq[0][i];
    for(int p = 1; p <= lg2[n]; p++)
    {
        for(int i = 1; i <= n; i++)
        {
            if((1 << (p - 1)) + i <= n)
                rmq[p][i] = min(rmq[p - 1][i], rmq[p - 1][i + (1 << (p - 1))]);
            else
                rmq[p][i] = rmq[p - 1][i];
        }
    }
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        int dif = y - x + 1;
        int lgrtm = lg2[dif];
        out << min(rmq[lgrtm][x], rmq[lgrtm][y - (1 << lgrtm) + 1]) << "\n";
    }
    return 0;
}